TSTP Solution File: LCL248-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL248-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:38 EDT 2022
% Result : Unsatisfiable 53.81s 54.01s
% Output : Refutation 53.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 36 unt; 0 nHn; 7 RR)
% Number of literals : 41 ( 4 equ; 7 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 74 ( 6 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(and_defn,axiom,
and(X,Y) = not(or(not(X),not(Y))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(10,plain,
and(X,Y) = not(implies(X,not(Y))),
inference('REWRITE',[status(thm)],[and_defn,implies_definition,theory(equality)]) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(and(p,q),implies(p,q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(12,plain,
theorem(implies(or(X,X),X)),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_2]) ).
cnf(13,plain,
theorem(implies(X,or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_3]) ).
cnf(14,plain,
theorem(implies(or(X,Y),or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_4]) ).
cnf(20,plain,
implies(implies(X,not(Y)),Z) = or(and(X,Y),Z),
inference('PARAMODULATE',[status(thm)],[implies_definition,10,theory(equality)]) ).
cnf(22,plain,
theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_5]) ).
cnf(25,plain,
theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_6]) ).
cnf(30,plain,
theorem(implies(X,implies(Y,X))),
inference('PARAMODULATE',[status(thm)],[13,implies_definition,theory(equality)]) ).
cnf(56,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[14,implies_definition,theory(equality)]) ).
cnf(57,plain,
theorem(implies(or(X,not(Y)),implies(Y,X))),
inference('PARAMODULATE',[status(thm)],[14,implies_definition,theory(equality)]) ).
cnf(402,plain,
theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[22,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(419,plain,
theorem(implies(or(X,or(Y,Y)),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,25,12]) ).
cnf(421,plain,
theorem(implies(or(X,Y),or(X,implies(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,25,30]) ).
cnf(426,plain,
theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(446,plain,
theorem(implies(implies(X,or(Y,Y)),implies(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[419,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(945,plain,
theorem(implies(implies(X,Y),implies(X,implies(Z,Y)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[421,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(1053,plain,
theorem(implies(X,X)),
inference('HYPERRESOLVE',[status(thm)],[rule_2,446,13]) ).
cnf(1089,plain,
theorem(or(X,not(X))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,1053,56]) ).
cnf(1170,plain,
theorem(implies(implies(X,not(Y)),not(and(X,Y)))),
inference('PARAMODULATE',[status(thm)],[1089,20,theory(equality)]) ).
cnf(4162,plain,
theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[402,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(7156,plain,
~ theorem(implies(and(p,q),q)),
inference('UR-RESOLVE',[status(thm)],[rule_2,945,prove_this]) ).
cnf(7254,plain,
~ theorem(or(q,not(and(p,q)))),
inference('UR-RESOLVE',[status(thm)],[rule_2,7156,57]) ).
cnf(22943,plain,
theorem(implies(or(X,Y),implies(implies(Y,Z),or(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,4162,25]) ).
cnf(22944,plain,
theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,4162,426]) ).
cnf(90577,plain,
theorem(implies(implies(not(X),Y),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,22943,1089]) ).
cnf(90952,plain,
~ theorem(implies(not(q),not(and(p,q)))),
inference('UR-RESOLVE',[status(thm)],[rule_2,90577,7254]) ).
cnf(99339,plain,
theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,22944,30]) ).
cnf(103671,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[rule_2,99339,90952,1170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL248-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 01:10:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 *
% 0.18/0.44 *
% 0.18/0.44 #<PACKAGE "SNARK-USER">
% 0.18/0.44 *
% 0.18/0.44 SNARK-TPTP-OPTIONS
% 0.18/0.44 *
% 0.18/0.44 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.44 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.44 (USE-FACTORING :POS)
% 0.18/0.44 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.44 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.44 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.44 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.44 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.44 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.44 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.44 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.44 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.44 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.44 *
% 0.18/0.44 "."
% 0.18/0.44 *
% 0.18/0.44 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T01:10:52
% 0.18/0.44 ; 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-04T01:10:52
% 53.81/54.01
% 53.81/54.01
% 53.81/54.01 #||
% 53.81/54.01 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 53.81/54.01 % SZS output start Refutation
% See solution above
% 53.81/54.01 ||#
% 53.81/54.01
% 53.81/54.01 ; Summary of computation:
% 53.81/54.01 ; 166735 formulas have been input or derived (from 753 formulas).
% 53.81/54.01 ; 103671 (62%) were retained. Of these,
% 53.81/54.01 ; 156 ( 0%) were simplified or subsumed later,
% 53.81/54.01 ; 103515 (100%) are still being kept.
% 53.81/54.01 ;
% 53.81/54.01 ; Run time in seconds excluding printing time:
% 53.81/54.01 ; 0.003 0% Read assertion file (1 call)
% 53.81/54.01 ; 0.000 0% Assert (10 calls)
% 53.81/54.01 ; 13.281 25% Process new row (146,230 calls)
% 53.81/54.01 ; 24.661 46% Resolution (1,504 calls)
% 53.81/54.01 ; 1.245 2% Paramodulation (752 calls)
% 53.81/54.01 ; 0.000 0% Condensing (2 calls)
% 53.81/54.01 ; 0.000 0% Forward subsumption (2 calls)
% 53.81/54.01 ; 0.000 0% Backward subsumption (2 calls)
% 53.81/54.01 ; 6.394 12% Forward simplification (146,228 calls)
% 53.81/54.01 ; 7.262 14% Backward simplification (103,670 calls)
% 53.81/54.01 ; 0.002 0% Ordering (1,453 calls)
% 53.81/54.01 ; 0.000 0% Sortal reasoning (32 calls)
% 53.81/54.01 ; 0.000 0% Purity testing (1 call)
% 53.81/54.01 ; 0.711 1% Other
% 53.81/54.01 ; 53.559 Total
% 53.81/54.01 ; 53.567 Real time
% 53.81/54.02 ;
% 53.81/54.02 ; Term-hash-array has 217,388 terms in all.
% 53.81/54.02 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 53.81/54.02 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 53.81/54.02 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 53.81/54.02 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 53.81/54.02 ; Path-index has 217,067 entries (217,067 at peak, 217,392 added, 325 deleted).
% 53.81/54.02 ; Path-index has 59,211 nodes (59,211 at peak, 59,217 added, 6 deleted).
% 53.81/54.02 ; Trie-index has 217,067 entries (217,067 at peak, 217,392 added, 325 deleted).
% 53.81/54.02 ; Trie-index has 575,463 nodes (575,463 at peak, 575,500 added, 37 deleted).
% 53.81/54.02 ; Retrieved 1,704,146 generalization terms in 544,802 calls.
% 53.81/54.02 ; Retrieved 405,700 instance terms in 103,667 calls.
% 53.81/54.02 ; Retrieved 23,084,781 unifiable terms in 53,169 calls.
% 53.81/54.02 ;
% 53.81/54.02 ; The agenda of rows to process has 811 entries:
% 53.81/54.02 ; 1 with value 12 89 with value 21 42 with value 29
% 53.81/54.02 ; 4 with value 14 46 with value 22 47 with value 30
% 53.81/54.02 ; 27 with value 15 64 with value 23 63 with value 31
% 53.81/54.02 ; 10 with value 16 68 with value 24 82 with value 32
% 53.81/54.02 ; 20 with value 17 12 with value 25 3 with value 33
% 53.81/54.02 ; 90 with value 18 20 with value 26 4 with value 34
% 53.81/54.02 ; 26 with value 19 19 with value 27 2 with value 35
% 53.81/54.02 ; 45 with value 20 21 with value 28 6 with value 37
% 53.81/54.02 ; The agenda of rows to give has 102763 entries:
% 53.81/54.02 ; 22 with value (4 19) 9199 with value (4 33) 18 with value (4 46)
% 53.81/54.02 ; 141 with value (4 20) 4114 with value (4 34) 12 with value (4 47)
% 53.81/54.02 ; 633 with value (4 21) 1288 with value (4 35) 8 with value (4 48)
% 53.81/54.02 ; 809 with value (4 22) 470 with value (4 36) 15 with value (4 49)
% 53.81/54.02 ; 1241 with value (4 23) 319 with value (4 37) 17 with value (4 50)
% 53.81/54.02 ; 1931 with value (4 24) 278 with value (4 38) 6 with value (4 51)
% 53.81/54.02 ; 2491 with value (4 25) 94 with value (4 39) 7 with value (4 52)
% 53.81/54.02 ; 3871 with value (4 26) 93 with value (4 40) 44 with value (4 53)
% 53.81/54.02 ; 6038 with value (4 27) 102 with value (4 41) 2 with value (4 54)
% 53.81/54.02 ; 8806 with value (4 28) 66 with value (4 42) 2 with value (4 55)
% 53.81/54.02 ; 11861 with value (4 29) 105 with value (4 43) 9 with value (4 56)
% 53.81/54.02 ; 16326 with value (4 30) 19 with value (4 44) 2 with value (4 59)
% 53.81/54.02 ; 15970 with value (4 31) 37 with value (4 45) 2 with value (4 67)
% 53.81/54.02 ; 16295 with value (4 32)
% 53.81/54.02 Evaluation took:
% 53.81/54.02 53.574 seconds of real time
% 53.81/54.02 51.616016 seconds of user run time
% 53.81/54.02 1.95303 seconds of system run time
% 53.81/54.02 [Run times include 13.774 seconds GC run time.]
% 53.81/54.02 0 calls to %EVAL
% 53.81/54.02 0 page faults and
% 53.81/54.02 1,936,124,840 bytes consed.
% 53.81/54.02 :PROOF-FOUND
% 53.81/54.02 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T01:11:46
% 53.81/54.02 :PROOF-FOUND
% 53.81/54.02 *
%------------------------------------------------------------------------------