TSTP Solution File: LCL297-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL297-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:22:01 EDT 2022
% Result : Unsatisfiable 0.37s 0.58s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 24 ( 22 unt; 0 nHn; 6 RR)
% Number of literals : 27 ( 4 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 : 7 ( 7 usr; 2 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(equivalent_defn,axiom,
equivalent(X,Y) = and(implies(X,Y),implies(Y,X)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(not(implies(p,not(q))),and(p,q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(13,plain,
~ theorem(equivalent(and(p,q),and(p,q))),
inference('REWRITE',[status(thm)],[prove_this,10,theory(equality)]) ).
cnf(14,plain,
theorem(implies(or(X,X),X)),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_2]) ).
cnf(15,plain,
theorem(implies(X,or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_3]) ).
cnf(16,plain,
theorem(implies(or(X,Y),or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_4]) ).
cnf(27,plain,
theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_6]) ).
cnf(29,plain,
theorem(implies(implies(X,not(X)),not(X))),
inference('PARAMODULATE',[status(thm)],[14,implies_definition,theory(equality)]) ).
cnf(41,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[16,implies_definition,theory(equality)]) ).
cnf(79,plain,
theorem(implies(X,and(X,X))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_2,41,29]),implies_definition,10,theory(equality)]) ).
cnf(86,plain,
theorem(implies(implies(X,X),equivalent(X,X))),
inference('PARAMODULATE',[status(thm)],[79,equivalent_defn,theory(equality)]) ).
cnf(133,plain,
~ theorem(implies(and(p,q),and(p,q))),
inference('UR-RESOLVE',[status(thm)],[rule_2,86,13]) ).
cnf(253,plain,
theorem(implies(or(X,or(Y,Y)),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,27,14]) ).
cnf(272,plain,
theorem(implies(implies(X,or(Y,Y)),implies(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[253,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(382,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[rule_2,272,133,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL297-3 : TPTP v8.1.0. Released v2.3.0.
% 0.06/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 : Sun Jul 3 16:05: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.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T16:05: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-03T16:05:22
% 0.37/0.58
% 0.37/0.58
% 0.37/0.58 #||
% 0.37/0.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.58 % SZS output start Refutation
% See solution above
% 0.37/0.58 ||#
% 0.37/0.58
% 0.37/0.58 ; Summary of computation:
% 0.37/0.58 ; 1480 formulas have been input or derived (from 67 formulas).
% 0.37/0.58 ; 382 (26%) were retained. Of these,
% 0.37/0.58 ; 4 ( 1%) were simplified or subsumed later,
% 0.37/0.58 ; 378 (99%) are still being kept.
% 0.37/0.58 ;
% 0.37/0.58 ; Run time in seconds excluding printing time:
% 0.37/0.58 ; 0.003 3% Read assertion file (1 call)
% 0.37/0.58 ; 0.001 1% Assert (11 calls)
% 0.37/0.58 ; 0.034 29% Process new row (1,040 calls)
% 0.37/0.58 ; 0.020 17% Resolution (132 calls)
% 0.37/0.58 ; 0.004 3% Paramodulation (66 calls)
% 0.37/0.58 ; 0.000 0% Condensing (2 calls)
% 0.37/0.58 ; 0.000 0% Forward subsumption (2 calls)
% 0.37/0.58 ; 0.000 0% Backward subsumption (2 calls)
% 0.37/0.59 ; 0.014 12% Forward simplification (1,040 calls)
% 0.37/0.59 ; 0.008 7% Backward simplification (380 calls)
% 0.37/0.59 ; 0.001 1% Ordering (138 calls)
% 0.37/0.59 ; 0.000 0% Sortal reasoning (32 calls)
% 0.37/0.59 ; 0.000 0% Purity testing (1 call)
% 0.37/0.59 ; 0.033 28% Other
% 0.37/0.59 ; 0.118 Total
% 0.37/0.59 ; 0.120 Real time
% 0.37/0.59 ;
% 0.37/0.59 ; Term-hash-array has 921 terms in all.
% 0.37/0.59 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 0.37/0.59 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 0.37/0.59 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 0.37/0.59 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 0.37/0.59 ; Path-index has 918 entries (918 at peak, 923 added, 5 deleted).
% 0.37/0.59 ; Path-index has 3,240 nodes (3,240 at peak, 3,258 added, 18 deleted).
% 0.37/0.59 ; Trie-index has 918 entries (918 at peak, 923 added, 5 deleted).
% 0.37/0.59 ; Trie-index has 4,895 nodes (4,895 at peak, 4,932 added, 37 deleted).
% 0.37/0.59 ; Retrieved 1,537 generalization terms in 2,365 calls.
% 0.37/0.59 ; Retrieved 428 instance terms in 377 calls.
% 0.37/0.59 ; Retrieved 7,894 unifiable terms in 713 calls.
% 0.37/0.59 ;
% 0.37/0.59 ; The agenda of rows to process has 41 entries:
% 0.37/0.59 ; 1 with value 10 6 with value 18 1 with value 23
% 0.37/0.59 ; 8 with value 13 1 with value 20 1 with value 26
% 0.37/0.59 ; 1 with value 14 7 with value 21 2 with value 27
% 0.37/0.59 ; 6 with value 15 1 with value 22 2 with value 29
% 0.37/0.59 ; 4 with value 16
% 0.37/0.59 ; The agenda of rows to give has 311 entries:
% 0.37/0.59 ; 6 with value (4 17) 14 with value (4 22) 29 with value (4 27)
% 0.37/0.59 ; 22 with value (4 18) 15 with value (4 23) 13 with value (4 28)
% 0.37/0.59 ; 21 with value (4 19) 30 with value (4 24) 17 with value (4 29)
% 0.37/0.59 ; 37 with value (4 20) 35 with value (4 25) 2 with value (4 31)
% 0.37/0.59 ; 41 with value (4 21) 26 with value (4 26) 3 with value (4 33)
% 0.37/0.59 Evaluation took:
% 0.37/0.59 0.12 seconds of real time
% 0.37/0.59 0.104623 seconds of user run time
% 0.37/0.59 0.01585 seconds of system run time
% 0.37/0.59 0 calls to %EVAL
% 0.37/0.59 0 page faults and
% 0.37/0.59 8,164,040 bytes consed.
% 0.37/0.59 :PROOF-FOUND
% 0.37/0.59 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T16:05:22
% 0.37/0.59 :PROOF-FOUND
% 0.37/0.59 *
%------------------------------------------------------------------------------