TSTP Solution File: LCL202-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL202-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n006.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:21:05 EDT 2022
% Result : Unsatisfiable 29.29s 29.52s
% Output : Refutation 29.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 28 unt; 0 nHn; 6 RR)
% Number of literals : 33 ( 1 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 58 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_2,axiom,
axiom(implies(or(X,X),X)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(implies(X,or(Y,X))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X,Y),or(Y,X))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(implies_definition,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(rule_2,axiom,
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(not(or(p,q)),or(p,not(q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(10,plain,
theorem(implies(or(X,X),X)),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_2]) ).
cnf(11,plain,
theorem(implies(X,or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_3]) ).
cnf(12,plain,
theorem(implies(or(X,Y),or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_4]) ).
cnf(18,plain,
theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_5]) ).
cnf(21,plain,
theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_6]) ).
cnf(48,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[12,implies_definition,theory(equality)]) ).
cnf(153,plain,
theorem(implies(implies(X,not(Y)),implies(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[48,implies_definition,theory(equality)]) ).
cnf(303,plain,
theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(318,plain,
theorem(implies(or(X,or(Y,Y)),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,10]) ).
cnf(319,plain,
theorem(implies(or(X,Y),or(X,or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,11]) ).
cnf(324,plain,
theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[21,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(343,plain,
theorem(implies(implies(X,or(Y,Y)),implies(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[318,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(391,plain,
theorem(implies(implies(X,Y),implies(X,or(Z,Y)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[319,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(684,plain,
theorem(implies(X,X)),
inference('HYPERRESOLVE',[status(thm)],[rule_2,343,11]) ).
cnf(715,plain,
theorem(implies(X,not(not(X)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,684,153]) ).
cnf(1199,plain,
~ theorem(implies(not(or(p,q)),not(q))),
inference('UR-RESOLVE',[status(thm)],[rule_2,391,prove_this]) ).
cnf(1404,plain,
~ theorem(implies(q,not(not(or(p,q))))),
inference('UR-RESOLVE',[status(thm)],[rule_2,1199,153]) ).
cnf(3122,plain,
theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[303,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(18057,plain,
theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,3122,324]) ).
cnf(66789,plain,
theorem(implies(implies(or(X,Y),Z),implies(Y,Z))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,18057,11]) ).
cnf(67600,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[rule_2,66789,1404,715]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL202-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 02:09:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T02:09:22
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n006.cluster.edu at 2022-07-04T02:09:22
% 29.29/29.52
% 29.29/29.52
% 29.29/29.52 #||
% 29.29/29.52 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 29.29/29.52 % SZS output start Refutation
% See solution above
% 29.29/29.52 ||#
% 29.29/29.52
% 29.29/29.52 ; Summary of computation:
% 29.29/29.52 ; 116770 formulas have been input or derived (from 611 formulas).
% 29.29/29.52 ; 67600 (58%) were retained. Of these,
% 29.29/29.52 ; 6 ( 0%) were simplified or subsumed later,
% 29.29/29.52 ; 67594 (100%) are still being kept.
% 29.29/29.52 ;
% 29.29/29.52 ; Run time in seconds excluding printing time:
% 29.29/29.52 ; 0.002 0% Read assertion file (1 call)
% 29.29/29.52 ; 0.000 0% Assert (9 calls)
% 29.29/29.52 ; 8.234 28% Process new row (100,672 calls)
% 29.29/29.52 ; 12.740 44% Resolution (1,220 calls)
% 29.29/29.52 ; 0.772 3% Paramodulation (610 calls)
% 29.29/29.52 ; 0.000 0% Condensing (2 calls)
% 29.29/29.52 ; 0.000 0% Forward subsumption (2 calls)
% 29.29/29.52 ; 0.000 0% Backward subsumption (2 calls)
% 29.29/29.52 ; 3.281 11% Forward simplification (100,672 calls)
% 29.29/29.52 ; 3.606 12% Backward simplification (67,600 calls)
% 29.29/29.52 ; 0.005 0% Ordering (492 calls)
% 29.29/29.52 ; 0.000 0% Sortal reasoning (32 calls)
% 29.29/29.52 ; 0.000 0% Purity testing (1 call)
% 29.29/29.52 ; 0.410 1% Other
% 29.29/29.52 ; 29.050 Total
% 29.29/29.52 ; 29.055 Real time
% 29.36/29.53 ;
% 29.36/29.53 ; Term-hash-array has 143,081 terms in all.
% 29.36/29.53 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 29.36/29.53 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 29.36/29.53 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 29.36/29.53 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 29.36/29.53 ; Path-index has 143,072 entries (143,072 at peak, 143,083 added, 11 deleted).
% 29.36/29.53 ; Path-index has 35,302 nodes (35,302 at peak, 35,302 added, 0 deleted).
% 29.36/29.53 ; Trie-index has 143,072 entries (143,072 at peak, 143,083 added, 11 deleted).
% 29.36/29.53 ; Trie-index has 340,231 nodes (340,231 at peak, 340,231 added, 0 deleted).
% 29.36/29.53 ; Retrieved 1,144,250 generalization terms in 299,676 calls.
% 29.36/29.53 ; Retrieved 265,699 instance terms in 67,597 calls.
% 29.36/29.53 ; Retrieved 13,509,912 unifiable terms in 36,376 calls.
% 29.36/29.53 ;
% 29.36/29.53 ; The agenda of rows to process has 670 entries:
% 29.36/29.53 ; 4 with value 12 40 with value 22 29 with value 30
% 29.36/29.53 ; 27 with value 15 51 with value 23 50 with value 31
% 29.36/29.53 ; 17 with value 16 45 with value 24 58 with value 32
% 29.36/29.53 ; 29 with value 17 11 with value 25 8 with value 33
% 29.36/29.53 ; 76 with value 18 16 with value 26 1 with value 35
% 29.36/29.53 ; 32 with value 19 12 with value 27 1 with value 37
% 29.36/29.53 ; 42 with value 20 23 with value 28 1 with value 38
% 29.36/29.53 ; 65 with value 21 32 with value 29
% 29.36/29.53 ; The agenda of rows to give has 66983 entries:
% 29.36/29.53 ; 2 with value (4 19) 10116 with value (4 32) 25 with value (4 45)
% 29.36/29.53 ; 94 with value (4 20) 6190 with value (4 33) 15 with value (4 46)
% 29.36/29.53 ; 481 with value (4 21) 2980 with value (4 34) 17 with value (4 47)
% 29.36/29.53 ; 595 with value (4 22) 942 with value (4 35) 7 with value (4 48)
% 29.36/29.53 ; 911 with value (4 23) 201 with value (4 36) 12 with value (4 49)
% 29.36/29.53 ; 1487 with value (4 24) 185 with value (4 37) 12 with value (4 50)
% 29.36/29.53 ; 1741 with value (4 25) 168 with value (4 38) 2 with value (4 51)
% 29.36/29.53 ; 2711 with value (4 26) 108 with value (4 39) 8 with value (4 52)
% 29.36/29.53 ; 3922 with value (4 27) 76 with value (4 40) 18 with value (4 53)
% 29.36/29.53 ; 5503 with value (4 28) 57 with value (4 41) 3 with value (4 55)
% 29.36/29.53 ; 7907 with value (4 29) 44 with value (4 42) 5 with value (4 56)
% 29.36/29.53 ; 10037 with value (4 30) 49 with value (4 43) 2 with value (4 59)
% 29.36/29.53 ; 10345 with value (4 31) 5 with value (4 44)
% 29.36/29.53 Evaluation took:
% 29.36/29.53 29.06 seconds of real time
% 29.36/29.53 27.8963 seconds of user run time
% 29.36/29.53 1.16105 seconds of system run time
% 29.36/29.53 [Run times include 6.379 seconds GC run time.]
% 29.36/29.53 0 calls to %EVAL
% 29.36/29.53 0 page faults and
% 29.36/29.53 1,220,443,248 bytes consed.
% 29.36/29.53 :PROOF-FOUND
% 29.36/29.53 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T02:09:51
% 29.36/29.53 :PROOF-FOUND
% 29.36/29.53 *
%------------------------------------------------------------------------------