TSTP Solution File: LCL239-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL239-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n004.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:32 EDT 2022
% Result : Unsatisfiable 0.40s 0.60s
% Output : Refutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 20 unt; 0 nHn; 4 RR)
% Number of literals : 25 ( 3 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; 1 con; 0-2 aty)
% Number of variables : 36 ( 2 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_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(not(and(p,not(p)))),
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(15,plain,
theorem(implies(or(X,Y),or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_4]) ).
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(39,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[15,implies_definition,theory(equality)]) ).
cnf(79,plain,
theorem(implies(implies(X,not(Y)),implies(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[39,implies_definition,theory(equality)]) ).
cnf(170,plain,
theorem(implies(or(X,or(Y,Y)),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,25,12]) ).
cnf(186,plain,
theorem(implies(implies(X,or(Y,Y)),implies(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[170,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(268,plain,
theorem(implies(X,X)),
inference('HYPERRESOLVE',[status(thm)],[rule_2,186,13]) ).
cnf(285,plain,
theorem(implies(X,not(not(X)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,268,79]) ).
cnf(317,plain,
theorem(not(and(X,not(X)))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_2,285,285]),10,theory(equality)]) ).
cnf(318,plain,
$false,
inference('REWRITE',[status(thm)],[prove_this,317]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL239-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n004.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 20:28:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T20:28:08
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-07-04T20:28:08
% 0.40/0.60
% 0.40/0.60
% 0.40/0.60 #||
% 0.40/0.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.60 % SZS output start Refutation
% See solution above
% 0.40/0.60 ||#
% 0.40/0.60
% 0.40/0.60 ; Summary of computation:
% 0.40/0.60 ; 1729 formulas have been input or derived (from 65 formulas).
% 0.40/0.60 ; 318 (18%) were retained. Of these,
% 0.40/0.60 ; 2 ( 1%) were simplified or subsumed later,
% 0.40/0.60 ; 316 (99%) are still being kept.
% 0.40/0.60 ;
% 0.40/0.60 ; Run time in seconds excluding printing time:
% 0.40/0.60 ; 0.003 3% Read assertion file (1 call)
% 0.40/0.60 ; 0.000 0% Assert (10 calls)
% 0.40/0.60 ; 0.038 35% Process new row (1,171 calls)
% 0.40/0.60 ; 0.017 16% Resolution (128 calls)
% 0.40/0.60 ; 0.002 2% Paramodulation (64 calls)
% 0.40/0.60 ; 0.000 0% Condensing (2 calls)
% 0.40/0.60 ; 0.000 0% Forward subsumption (2 calls)
% 0.40/0.60 ; 0.000 0% Backward subsumption (2 calls)
% 0.40/0.60 ; 0.011 10% Forward simplification (1,171 calls)
% 0.40/0.60 ; 0.005 5% Backward simplification (317 calls)
% 0.40/0.60 ; 0.000 0% Ordering (131 calls)
% 0.40/0.60 ; 0.001 1% Sortal reasoning (32 calls)
% 0.40/0.60 ; 0.000 0% Purity testing (1 call)
% 0.40/0.60 ; 0.032 29% Other
% 0.40/0.60 ; 0.109 Total
% 0.40/0.60 ; 0.110 Real time
% 0.40/0.60 ;
% 0.40/0.60 ; Term-hash-array has 812 terms in all.
% 0.40/0.60 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 0.40/0.60 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 0.40/0.60 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 0.40/0.60 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 0.40/0.60 ; Path-index has 812 entries (813 at peak, 813 added, 1 deleted).
% 0.40/0.60 ; Path-index has 2,795 nodes (2,797 at peak, 2,797 added, 2 deleted).
% 0.40/0.60 ; Trie-index has 812 entries (813 at peak, 813 added, 1 deleted).
% 0.40/0.60 ; Trie-index has 3,782 nodes (3,785 at peak, 3,785 added, 3 deleted).
% 0.40/0.60 ; Retrieved 1,545 generalization terms in 2,244 calls.
% 0.40/0.60 ; Retrieved 740 instance terms in 314 calls.
% 0.40/0.60 ; Retrieved 8,277 unifiable terms in 673 calls.
% 0.40/0.60 ;
% 0.40/0.60 ; The agenda of rows to process has 77 entries:
% 0.40/0.60 ; 6 with value 20 26 with value 22 18 with value 24
% 0.40/0.60 ; 6 with value 21 17 with value 23 4 with value 26
% 0.40/0.60 ; The agenda of rows to give has 252 entries:
% 0.40/0.60 ; 1 with value (4 15) 36 with value (4 21) 4 with value (4 26)
% 0.40/0.60 ; 4 with value (4 16) 19 with value (4 22) 5 with value (4 27)
% 0.40/0.60 ; 10 with value (4 17) 17 with value (4 23) 4 with value (4 28)
% 0.40/0.60 ; 31 with value (4 18) 16 with value (4 24) 9 with value (4 29)
% 0.40/0.60 ; 30 with value (4 19) 28 with value (4 25) 2 with value (4 33)
% 0.40/0.60 ; 36 with value (4 20)
% 0.40/0.60 Evaluation took:
% 0.40/0.60 0.111 seconds of real time
% 0.40/0.60 0.09608 seconds of user run time
% 0.40/0.60 0.014992 seconds of system run time
% 0.40/0.60 0 calls to %EVAL
% 0.40/0.60 0 page faults and
% 0.40/0.60 7,476,192 bytes consed.
% 0.40/0.60 :PROOF-FOUND
% 0.40/0.60 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T20:28:08
% 0.40/0.60 :PROOF-FOUND
% 0.40/0.60 *
%------------------------------------------------------------------------------