TSTP Solution File: LCL203-10 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL203-10 : TPTP v8.1.0. Released v7.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:06 EDT 2022
% Result : Unsatisfiable 3.45s 3.65s
% Output : Refutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 3 RR)
% Number of literals : 34 ( 33 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 66 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
ifeq(X,X,Y,Z) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X,X),X)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(implies(X,or(Y,X))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X,Y),or(Y,X))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
cnf(implies_definition,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
cnf(rule_1,axiom,
ifeq(axiom(X),true,theorem(X),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
cnf(rule_2,axiom,
ifeq(theorem(implies(X,Y)),true,ifeq(theorem(X),true,theorem(Y),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
cnf(prove_this,negated_conjecture,
theorem(implies(not(or(p,q)),or(not(p),not(q)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(11,plain,
theorem(implies(not(or(p,q)),implies(p,not(q)))) != true,
inference('REWRITE',[status(thm)],[prove_this,implies_definition,theory(equality)]) ).
cnf(14,plain,
theorem(implies(or(X,X),X)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_1,axiom_1_2,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(15,plain,
theorem(implies(X,or(Y,X))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_1,axiom_1_3,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(18,plain,
theorem(implies(or(X,Y),or(Y,X))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_1,axiom_1_4,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(22,plain,
axiom(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[axiom_1_6,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(27,plain,
ifeq(theorem(implies(implies(or(X,X),X),Y)),true,theorem(Y),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_2,14,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(30,plain,
ifeq(theorem(implies(implies(X,or(Y,X)),Z)),true,theorem(Z),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_2,15,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(35,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))) = true,
inference('PARAMODULATE',[status(thm)],[18,implies_definition,theory(equality)]) ).
cnf(60,plain,
theorem(implies(implies(X,not(Y)),implies(Y,not(X)))) = true,
inference('PARAMODULATE',[status(thm)],[35,implies_definition,theory(equality)]) ).
cnf(61,plain,
ifeq(theorem(implies(X,Y)),true,theorem(or(Y,not(X))),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_2,35,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(116,plain,
theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_1,22,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(126,plain,
ifeq(theorem(implies(X,not(Y))),true,theorem(implies(Y,not(X))),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_2,60,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(147,plain,
ifeq(theorem(implies(X,Y)),true,theorem(implies(implies(Z,X),implies(Z,Y))),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_2,116,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(285,plain,
theorem(implies(implies(X,or(Y,Y)),implies(X,Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[27,116,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(311,plain,
theorem(implies(X,X)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[30,285,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(314,plain,
theorem(implies(implies(X,Y),implies(X,or(Z,Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[30,116,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(317,plain,
theorem(or(X,not(X))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[61,311,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(326,plain,
theorem(implies(X,not(not(X)))) = true,
inference('PARAMODULATE',[status(thm)],[317,implies_definition,theory(equality)]) ).
cnf(363,plain,
theorem(implies(implies(X,Y),implies(X,implies(Z,Y)))) = true,
inference('PARAMODULATE',[status(thm)],[314,implies_definition,theory(equality)]) ).
cnf(449,plain,
ifeq(theorem(implies(X,Y)),true,theorem(implies(X,implies(Z,Y))),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_2,363,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(4120,plain,
theorem(implies(implies(X,Y),implies(X,not(not(Y))))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[147,326,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(9088,plain,
theorem(implies(X,not(not(or(Y,X))))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[30,4120,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(9134,plain,
theorem(implies(not(or(X,Y)),not(Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[126,9088,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(9198,plain,
theorem(implies(not(or(X,Y)),implies(Z,not(Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[449,9134,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(9199,plain,
$false,
inference('REWRITE',[status(thm)],[11,9198,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL203-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 23:41:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.48 #<PACKAGE "SNARK-USER">
% 0.19/0.48 *
% 0.19/0.48 SNARK-TPTP-OPTIONS
% 0.19/0.48 *
% 0.19/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T23:41:51
% 0.19/0.48 ; 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-03T23:41:51
% 3.45/3.65
% 3.45/3.65
% 3.45/3.65 #||
% 3.45/3.65 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.45/3.65 % SZS output start Refutation
% See solution above
% 3.45/3.65 ||#
% 3.45/3.65
% 3.45/3.65 ; Summary of computation:
% 3.45/3.65 ; 47067 formulas have been input or derived (from 636 formulas).
% 3.45/3.65 ; 9199 (20%) were retained. Of these,
% 3.45/3.65 ; 42 ( 0%) were simplified or subsumed later,
% 3.45/3.65 ; 9157 (100%) are still being kept.
% 3.45/3.65 ;
% 3.45/3.65 ; Run time in seconds excluding printing time:
% 3.45/3.65 ; 0.002 0% Read assertion file (1 call)
% 3.45/3.65 ; 0.001 0% Assert (10 calls)
% 3.45/3.65 ; 1.054 33% Process new row (25,951 calls)
% 3.45/3.65 ; 0.048 2% Resolution (1,270 calls)
% 3.45/3.65 ; 0.903 28% Paramodulation (635 calls)
% 3.45/3.65 ; 0.764 24% Forward simplification (25,951 calls)
% 3.45/3.65 ; 0.217 7% Backward simplification (9,198 calls)
% 3.45/3.65 ; 0.061 2% Ordering (65,563 calls)
% 3.45/3.65 ; 0.000 0% Sortal reasoning (32 calls)
% 3.45/3.65 ; 0.000 0% Purity testing (1 call)
% 3.45/3.65 ; 0.121 4% Other
% 3.45/3.65 ; 3.171 Total
% 3.45/3.65 ; 3.173 Real time
% 3.45/3.65 ;
% 3.45/3.65 ; Term-hash-array has 34,433 terms in all.
% 3.45/3.65 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 3.45/3.65 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 3.45/3.65 ; Path-index has 34,297 entries (34,306 at peak, 34,446 added, 149 deleted).
% 3.45/3.65 ; Path-index has 48,262 nodes (48,283 at peak, 48,380 added, 118 deleted).
% 3.45/3.65 ; Trie-index has 34,297 entries (34,306 at peak, 34,446 added, 149 deleted).
% 3.45/3.65 ; Trie-index has 109,576 nodes (109,605 at peak, 110,307 added, 731 deleted).
% 3.45/3.65 ; Retrieved 149,214 generalization terms in 139,633 calls.
% 3.45/3.65 ; Retrieved 26,192 instance terms in 9,197 calls.
% 3.45/3.65 ; Retrieved 313,790 unifiable terms in 5,241 calls.
% 3.45/3.65 ;
% 3.45/3.65 ; The agenda of rows to process has 32 entries:
% 3.45/3.65 ; 3 with value 32 6 with value 36 1 with value 43
% 3.45/3.65 ; 5 with value 33 4 with value 37 2 with value 48
% 3.45/3.65 ; 1 with value 34 3 with value 38 1 with value 56
% 3.45/3.65 ; 4 with value 35 2 with value 39
% 3.45/3.65 ; The agenda of rows to give has 8522 entries:
% 3.45/3.65 ; 1 with value (4 24) 1500 with value (4 32) 74 with value (4 40)
% 3.45/3.65 ; 20 with value (4 25) 619 with value (4 33) 89 with value (4 41)
% 3.45/3.65 ; 351 with value (4 26) 610 with value (4 34) 56 with value (4 42)
% 3.45/3.65 ; 573 with value (4 27) 265 with value (4 35) 61 with value (4 43)
% 3.45/3.65 ; 793 with value (4 28) 50 with value (4 36) 4 with value (4 44)
% 3.45/3.65 ; 1147 with value (4 29) 31 with value (4 37) 8 with value (4 45)
% 3.45/3.65 ; 951 with value (4 30) 58 with value (4 38) 5 with value (4 47)
% 3.45/3.65 ; 1181 with value (4 31) 75 with value (4 39)
% 3.45/3.65 Evaluation took:
% 3.45/3.65 3.175 seconds of real time
% 3.45/3.65 2.875696 seconds of user run time
% 3.45/3.65 0.298926 seconds of system run time
% 3.45/3.65 [Run times include 0.612 seconds GC run time.]
% 3.45/3.65 0 calls to %EVAL
% 3.45/3.65 0 page faults and
% 3.45/3.65 244,750,760 bytes consed.
% 3.45/3.65 :PROOF-FOUND
% 3.45/3.65 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T23:41:54
% 3.45/3.65 :PROOF-FOUND
% 3.45/3.65 *
%------------------------------------------------------------------------------