TSTP Solution File: LCL531+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL531+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 14:23:29 EDT 2022
% Result : Theorem 0.47s 0.65s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of clauses : 29 ( 19 unt; 0 nHn; 18 RR)
% Number of literals : 44 ( 4 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ modus_ponens
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y))
| is_a_theorem(Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
cnf(12,axiom,
( ~ implies_2
| is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_2) ).
cnf(20,axiom,
( ~ and_3
| is_a_theorem(implies(X,implies(Y,and(X,Y)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_3) ).
cnf(57,axiom,
( ~ op_implies_and
| implies(X,Y) = not(and(X,not(Y))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
cnf(60,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
cnf(62,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
cnf(65,axiom,
implies_2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_2) ).
cnf(69,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
cnf(77,axiom,
( ~ necessitation
| ~ is_a_theorem(X)
| is_a_theorem(necessarily(X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',necessitation) ).
cnf(116,axiom,
( axiom_m4
| ~ is_a_theorem(strict_implies('SKOLEMAAAV84',and('SKOLEMAAAV84','SKOLEMAAAV84'))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m4) ).
cnf(130,axiom,
( ~ op_strict_implies
| strict_implies(X,Y) = necessarily(implies(X,Y)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_strict_implies) ).
cnf(133,axiom,
necessitation,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_necessitation) ).
cnf(137,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
cnf(139,negated_conjecture,
~ axiom_m4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m4) ).
cnf(140,plain,
~ is_a_theorem(strict_implies('SKOLEMAAAV84',and('SKOLEMAAAV84','SKOLEMAAAV84'))),
inference('REWRITE',[status(thm)],[116,139]) ).
cnf(142,plain,
strict_implies(X,Y) = necessarily(implies(X,Y)),
inference('REWRITE',[status(thm)],[130,137]) ).
cnf(149,plain,
~ is_a_theorem(necessarily(implies('SKOLEMAAAV84',and('SKOLEMAAAV84','SKOLEMAAAV84')))),
inference('REWRITE',[status(thm)],[140,142,theory(equality)]) ).
cnf(176,plain,
( ~ is_a_theorem(X)
| is_a_theorem(necessarily(X)) ),
inference('REWRITE',[status(thm)],[77,133]) ).
cnf(203,plain,
is_a_theorem(implies(X,implies(Y,and(X,Y)))),
inference('REWRITE',[status(thm)],[20,69]) ).
cnf(209,plain,
is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))),
inference('REWRITE',[status(thm)],[12,65]) ).
cnf(212,plain,
( ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y))
| is_a_theorem(Y) ),
inference('REWRITE',[status(thm)],[1,62]) ).
cnf(214,plain,
implies(X,Y) = not(and(X,not(Y))),
inference('REWRITE',[status(thm)],[57,60]) ).
cnf(223,plain,
is_a_theorem(not(and(X,not(not(and(Y,not(and(X,Y)))))))),
inference('REWRITE',[status(thm)],[203,214,theory(equality)]) ).
cnf(228,plain,
~ is_a_theorem(necessarily(not(and('SKOLEMAAAV84',not(and('SKOLEMAAAV84','SKOLEMAAAV84')))))),
inference('REWRITE',[status(thm)],[149,214,theory(equality)]) ).
cnf(270,plain,
is_a_theorem(not(and(not(and(X,not(not(and(X,not(Y)))))),not(not(and(X,not(Y))))))),
inference('REWRITE',[status(thm)],[209,214,theory(equality)]) ).
cnf(271,plain,
( ~ is_a_theorem(X)
| ~ is_a_theorem(not(and(X,not(Y))))
| is_a_theorem(Y) ),
inference('REWRITE',[status(thm)],[212,214,theory(equality)]) ).
cnf(307,plain,
~ is_a_theorem(not(and('SKOLEMAAAV84',not(and('SKOLEMAAAV84','SKOLEMAAAV84'))))),
inference('UR-RESOLVE',[status(thm)],[176,228]) ).
cnf(379,plain,
is_a_theorem(not(and(X,not(and(X,X))))),
inference('HYPERRESOLVE',[status(thm)],[271,270,223]) ).
cnf(380,plain,
$false,
inference('REWRITE',[status(thm)],[307,379]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL531+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : run-snark %s %d
% 0.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jul 3 18:18:36 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.49 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50 *
% 0.21/0.50 *
% 0.21/0.50 #<PACKAGE "SNARK-USER">
% 0.21/0.50 *
% 0.21/0.50 SNARK-TPTP-OPTIONS
% 0.21/0.50 *
% 0.21/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.50 (USE-FACTORING :POS)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.50 *
% 0.21/0.50 "."
% 0.21/0.50 *
% 0.21/0.51 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T18:18:36
% 0.21/0.51 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-07-03T18:18:36
% 0.37/0.54 WARNING:
% 0.37/0.54 #:|op_necessarily| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.37/0.54 WARNING:
% 0.37/0.54 #:|op_implies_or| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.37/0.54 WARNING:
% 0.37/0.54 #:|op_and| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.37/0.54 WARNING:
% 0.37/0.54 #:|op_implies| is a proposition that occurs only positively; disabling rows that contain it.
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 #||
% 0.47/0.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.65 % SZS output start Refutation
% See solution above
% 0.47/0.65 ||#
% 0.47/0.65
% 0.47/0.65 ; Summary of computation:
% 0.47/0.65 ; 459 formulas have been input or derived (from 88 formulas).
% 0.47/0.65 ; 380 (83%) were retained. Of these,
% 0.47/0.65 ; 198 (52%) were simplified or subsumed later,
% 0.47/0.65 ; 182 (48%) are still being kept.
% 0.47/0.65 ;
% 0.47/0.65 ; Run time in seconds excluding printing time:
% 0.47/0.65 ; 0.016 11% Read assertion file (1 call)
% 0.47/0.65 ; 0.006 4% Assert (88 calls)
% 0.47/0.65 ; 0.035 25% Process new row (424 calls)
% 0.47/0.65 ; 0.008 6% Resolution (174 calls)
% 0.47/0.65 ; 0.002 1% Paramodulation (87 calls)
% 0.47/0.65 ; 0.000 0% Factoring (5 calls)
% 0.47/0.65 ; 0.003 2% Condensing (244 calls)
% 0.47/0.65 ; 0.012 9% Forward subsumption (244 calls)
% 0.47/0.65 ; 0.004 3% Backward subsumption (244 calls)
% 0.47/0.65 ; 0.000 0% Clause clause subsumption (6 calls)
% 0.47/0.65 ; 0.011 8% Forward simplification (420 calls)
% 0.47/0.65 ; 0.019 13% Backward simplification (380 calls)
% 0.47/0.65 ; 0.001 1% Ordering (94 calls)
% 0.47/0.65 ; 0.000 0% Sortal reasoning (32 calls)
% 0.47/0.65 ; 0.001 1% Purity testing (1 call)
% 0.47/0.65 ; 0.023 16% Other
% 0.47/0.65 ; 0.141 Total
% 0.47/0.65 ; 0.144 Real time
% 0.47/0.65 ;
% 0.47/0.65 ; Term-hash-array has 1,361 terms in all.
% 0.47/0.65 ; Feature-vector-row-index has 76 entries (78 at peak, 244 added, 168 deleted).
% 0.47/0.65 ; Feature-vector-row-index has 711 nodes (726 at peak, 1,958 added, 1,247 deleted).
% 0.47/0.65 ; Retrieved 21 possibly forward subsuming rows in 244 calls.
% 0.47/0.65 ; Retrieved 13 possibly backward subsumed rows in 244 calls.
% 0.47/0.65 ; Path-index has 884 entries (892 at peak, 1,870 added, 986 deleted).
% 0.47/0.65 ; Path-index has 3,310 nodes (3,326 at peak, 5,130 added, 1,820 deleted).
% 0.47/0.65 ; Trie-index has 884 entries (892 at peak, 1,870 added, 986 deleted).
% 0.47/0.65 ; Trie-index has 4,008 nodes (4,032 at peak, 7,117 added, 3,109 deleted).
% 0.47/0.65 ; Retrieved 228 generalization terms in 834 calls.
% 0.47/0.65 ; Retrieved 444 instance terms in 135 calls.
% 0.47/0.65 ; Retrieved 4,263 unifiable terms in 775 calls.
% 0.47/0.65 ;
% 0.47/0.65 ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.47/0.65 ; 1 with value 0
% 0.47/0.65 ; The agenda of rows to process has 6 entries:
% 0.47/0.65 ; 1 with value 26 1 with value 35 1 with value 38
% 0.47/0.65 ; 1 with value 30 1 with value 36 1 with value 41
% 0.47/0.65 ; The agenda of input rows to give has 18 entries:
% 0.47/0.65 ; 4 with value 30 2 with value 35 2 with value 37
% 0.47/0.65 ; 3 with value 32 2 with value 36 3 with value 39
% 0.47/0.65 ; 2 with value 34
% 0.47/0.65 ; The agenda of rows to give has 78 entries:
% 0.47/0.65 ; 3 with value (4 7) 5 with value (4 20) 2 with value (4 30)
% 0.47/0.65 ; 1 with value (4 11) 4 with value (4 21) 3 with value (4 31)
% 0.47/0.65 ; 4 with value (4 12) 3 with value (4 22) 4 with value (4 32)
% 0.47/0.65 ; 3 with value (4 13) 3 with value (4 23) 1 with value (4 33)
% 0.47/0.65 ; 4 with value (4 14) 3 with value (4 24) 3 with value (4 34)
% 0.47/0.65 ; 6 with value (4 15) 1 with value (4 25) 1 with value (4 35)
% 0.47/0.65 ; 1 with value (4 16) 3 with value (4 26) 1 with value (4 36)
% 0.47/0.65 ; 1 with value (4 17) 1 with value (4 27) 1 with value (4 37)
% 0.47/0.65 ; 2 with value (4 18) 4 with value (4 28) 1 with value (4 39)
% 0.47/0.65 ; 3 with value (4 19) 6 with value (4 29)
% 0.47/0.65 Evaluation took:
% 0.47/0.65 0.145 seconds of real time
% 0.47/0.65 0.129167 seconds of user run time
% 0.47/0.65 0.014948 seconds of system run time
% 0.47/0.65 0 calls to %EVAL
% 0.47/0.65 0 page faults and
% 0.47/0.65 11,947,712 bytes consed.
% 0.47/0.65 :PROOF-FOUND
% 0.47/0.65 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T18:18:36
% 0.47/0.65 :PROOF-FOUND
% 0.47/0.65 *
%------------------------------------------------------------------------------