TSTP Solution File: LCL218-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL218-3 : TPTP v8.1.0. Released v2.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:21:18 EDT 2022
% Result : Unsatisfiable 36.28s 36.49s
% Output : Refutation 36.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 27 unt; 0 nHn; 4 RR)
% Number of literals : 32 ( 1 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 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 : 59 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_2,axiom,
axiom(implies(or(X,X),X)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(implies(X,or(Y,X))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X,Y),or(Y,X))),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(implies_definition,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(rule_2,axiom,
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(implies(or(p,q),q),implies(p,q))),
file('/export/starexec/sandbox2/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(52,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[12,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(321,plain,
theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,12]) ).
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(836,plain,
theorem(implies(X,X)),
inference('HYPERRESOLVE',[status(thm)],[rule_2,343,11]) ).
cnf(868,plain,
theorem(or(X,not(X))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,836,52]) ).
cnf(931,plain,
theorem(or(X,or(Y,not(X)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,868,319]) ).
cnf(3047,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(3585,plain,
theorem(or(X,implies(X,Y))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_2,321,931]),implies_definition,theory(equality)]) ).
cnf(3731,plain,
theorem(implies(X,or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,3585,303]) ).
cnf(19098,plain,
theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,3047,324]) ).
cnf(74983,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[rule_2,19098,prove_this,3731]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL218-3 : TPTP v8.1.0. Released v2.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 : Mon Jul 4 15:19:36 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.49 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.50 *
% 0.22/0.50 *
% 0.22/0.51 #<PACKAGE "SNARK-USER">
% 0.22/0.51 *
% 0.22/0.51 SNARK-TPTP-OPTIONS
% 0.22/0.51 *
% 0.22/0.51 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.51 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.51 (USE-FACTORING :POS)
% 0.22/0.51 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.51 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.51 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.51 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.51 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.51 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.51 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.51 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.51 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.51 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.51 *
% 0.22/0.51 "."
% 0.22/0.51 *
% 0.22/0.51 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T15:19:36
% 0.22/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-04T15:19:36
% 36.28/36.49
% 36.28/36.49
% 36.28/36.49 #||
% 36.28/36.49 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 36.28/36.49 % SZS output start Refutation
% See solution above
% 36.28/36.49 ||#
% 36.28/36.49
% 36.28/36.49 ; Summary of computation:
% 36.28/36.49 ; 123545 formulas have been input or derived (from 639 formulas).
% 36.28/36.49 ; 74983 (61%) were retained. Of these,
% 36.28/36.49 ; 7 ( 0%) were simplified or subsumed later,
% 36.28/36.49 ; 74976 (100%) are still being kept.
% 36.28/36.49 ;
% 36.28/36.49 ; Run time in seconds excluding printing time:
% 36.28/36.49 ; 0.002 0% Read assertion file (1 call)
% 36.28/36.49 ; 0.000 0% Assert (9 calls)
% 36.28/36.49 ; 10.615 30% Process new row (107,413 calls)
% 36.28/36.49 ; 15.361 43% Resolution (1,276 calls)
% 36.28/36.49 ; 0.879 2% Paramodulation (638 calls)
% 36.28/36.49 ; 0.000 0% Condensing (2 calls)
% 36.28/36.49 ; 0.000 0% Forward subsumption (2 calls)
% 36.28/36.49 ; 0.000 0% Backward subsumption (2 calls)
% 36.28/36.49 ; 4.357 12% Forward simplification (107,413 calls)
% 36.28/36.49 ; 4.307 12% Backward simplification (74,983 calls)
% 36.28/36.49 ; 0.001 0% Ordering (514 calls)
% 36.28/36.49 ; 0.000 0% Sortal reasoning (32 calls)
% 36.28/36.49 ; 0.000 0% Purity testing (1 call)
% 36.28/36.49 ; 0.450 1% Other
% 36.28/36.49 ; 35.972 Total
% 36.28/36.49 ; 35.980 Real time
% 36.28/36.49 ;
% 36.28/36.49 ; Term-hash-array has 157,781 terms in all.
% 36.28/36.49 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 36.28/36.49 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 36.28/36.49 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 36.28/36.49 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 36.28/36.49 ; Path-index has 157,770 entries (157,770 at peak, 157,783 added, 13 deleted).
% 36.28/36.49 ; Path-index has 37,035 nodes (37,035 at peak, 37,035 added, 0 deleted).
% 36.28/36.50 ; Trie-index has 157,770 entries (157,770 at peak, 157,783 added, 13 deleted).
% 36.28/36.50 ; Trie-index has 382,426 nodes (382,426 at peak, 382,426 added, 0 deleted).
% 36.28/36.50 ; Retrieved 1,305,326 generalization terms in 329,580 calls.
% 36.28/36.50 ; Retrieved 252,093 instance terms in 74,980 calls.
% 36.28/36.50 ; Retrieved 14,483,422 unifiable terms in 39,207 calls.
% 36.28/36.50 ;
% 36.28/36.50 ; The agenda of rows to process has 658 entries:
% 36.28/36.50 ; 3 with value 12 18 with value 22 18 with value 30
% 36.28/36.50 ; 8 with value 14 22 with value 23 31 with value 31
% 36.28/36.50 ; 7 with value 15 61 with value 24 36 with value 32
% 36.28/36.50 ; 14 with value 16 68 with value 25 52 with value 33
% 36.28/36.50 ; 28 with value 17 106 with value 26 74 with value 34
% 36.28/36.50 ; 34 with value 18 14 with value 27 4 with value 35
% 36.28/36.50 ; 14 with value 19 7 with value 28 1 with value 38
% 36.28/36.50 ; 4 with value 20 20 with value 29 4 with value 41
% 36.28/36.50 ; 10 with value 21
% 36.28/36.50 ; The agenda of rows to give has 74337 entries:
% 36.28/36.50 ; 98 with value (4 20) 7139 with value (4 33) 22 with value (4 45)
% 36.28/36.50 ; 509 with value (4 21) 3322 with value (4 34) 17 with value (4 46)
% 36.28/36.50 ; 600 with value (4 22) 1010 with value (4 35) 13 with value (4 47)
% 36.28/36.50 ; 932 with value (4 23) 223 with value (4 36) 4 with value (4 48)
% 36.28/36.50 ; 1445 with value (4 24) 198 with value (4 37) 13 with value (4 49)
% 36.28/36.50 ; 1849 with value (4 25) 166 with value (4 38) 13 with value (4 50)
% 36.28/36.50 ; 2743 with value (4 26) 96 with value (4 39) 4 with value (4 51)
% 36.28/36.50 ; 4298 with value (4 27) 78 with value (4 40) 7 with value (4 52)
% 36.28/36.50 ; 6127 with value (4 28) 61 with value (4 41) 36 with value (4 53)
% 36.28/36.50 ; 8381 with value (4 29) 46 with value (4 42) 2 with value (4 55)
% 36.28/36.50 ; 11224 with value (4 30) 84 with value (4 43) 5 with value (4 56)
% 36.28/36.50 ; 11396 with value (4 31) 14 with value (4 44) 1 with value (4 59)
% 36.28/36.50 ; 12161 with value (4 32)
% 36.28/36.50 Evaluation took:
% 36.28/36.50 35.988 seconds of real time
% 36.28/36.50 34.508446 seconds of user run time
% 36.28/36.50 1.473905 seconds of system run time
% 36.28/36.50 [Run times include 7.842 seconds GC run time.]
% 36.28/36.50 0 calls to %EVAL
% 36.28/36.50 0 page faults and
% 36.28/36.50 1,340,568,264 bytes consed.
% 36.28/36.50 :PROOF-FOUND
% 36.28/36.50 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T15:20:12
% 36.28/36.50 :PROOF-FOUND
% 36.28/36.50 *
%------------------------------------------------------------------------------