TSTP Solution File: LCL903+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL903+1 : TPTP v8.1.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n014.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:26:57 EDT 2022
% Result : Theorem 27.53s 27.70s
% Output : Refutation 27.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 38 ( 31 unt; 0 nHn; 8 RR)
% Number of literals : 47 ( 11 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
'+'(X,'0') = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_03) ).
cnf(2,axiom,
'>='(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).
cnf(3,axiom,
( ~ '>='(X,Y)
| ~ '>='(Y,Z)
| '>='(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_05) ).
cnf(4,axiom,
( ~ '>='(X,Y)
| ~ '>='(Y,X)
| X = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_06) ).
cnf(5,axiom,
( ~ '>='('+'(X,Y),Z)
| '>='(Y,'==>'(X,Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
cnf(6,axiom,
( '>='('+'(X,Y),Z)
| ~ '>='(Y,'==>'(X,Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
cnf(7,axiom,
'>='(X,'0'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).
cnf(8,axiom,
( ~ '>='(X,Y)
| '>='('+'(X,Z),'+'(Y,Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_09) ).
cnf(9,axiom,
( ~ '>='(X,Y)
| '>='('==>'(Y,Z),'==>'(X,Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_10) ).
cnf(10,axiom,
( ~ '>='(X,Y)
| '>='('==>'(Z,X),'==>'(Z,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_11) ).
cnf(11,axiom,
'+'(X,'1') = '1',
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_12) ).
cnf(13,axiom,
'==>'('==>'('==>'(X,'1'),X),X) = '0',
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_13) ).
cnf(14,negated_conjecture,
'+'('SKOLEMAAAL1','SKOLEMAAAL1') != 'SKOLEMAAAL1',
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).
cnf(15,plain,
'>='('+'(X,Y),Y),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[8,7]),1,theory(equality)]) ).
cnf(25,plain,
'>='('+'(X,'==>'(X,Y)),Y),
inference('HYPERRESOLVE',[status(thm)],[6,2]) ).
cnf(27,plain,
'>='('1',X),
inference('PARAMODULATE',[status(thm)],[15,11,theory(equality)]) ).
cnf(29,plain,
'>='(X,'==>'(Y,X)),
inference('HYPERRESOLVE',[status(thm)],[5,15]) ).
cnf(31,plain,
~ '>='('SKOLEMAAAL1','+'('SKOLEMAAAL1','SKOLEMAAAL1')),
inference('UR-RESOLVE',[status(thm)],[4,15,14]) ).
cnf(40,plain,
'>='('==>'(X,'1'),'==>'(X,Y)),
inference('HYPERRESOLVE',[status(thm)],[10,27]) ).
cnf(74,plain,
'>='('==>'('0',X),X),
inference('PARAMODULATE',[status(thm)],[25,1,theory(equality)]) ).
cnf(75,plain,
'>='(X,'==>'('==>'(X,Y),Y)),
inference('HYPERRESOLVE',[status(thm)],[5,25]) ).
cnf(83,plain,
'>='('+'(X,'==>'('+'(X,Y),Z)),'==>'(Y,Z)),
inference('HYPERRESOLVE',[status(thm)],[5,25]) ).
cnf(87,plain,
'>='('+'(X,'+'(Y,'==>'(Y,'==>'(X,Z)))),Z),
inference('HYPERRESOLVE',[status(thm)],[6,25]) ).
cnf(91,plain,
'==>'('0',X) = X,
inference('HYPERRESOLVE',[status(thm)],[4,74,29]) ).
cnf(112,plain,
'>='('==>'('==>'(X,Y),Z),'==>'('==>'(X,'1'),Z)),
inference('HYPERRESOLVE',[status(thm)],[9,40]) ).
cnf(126,plain,
'>='('==>'('==>'(X,'1'),X),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[75,13,theory(equality)]),91,theory(equality)]) ).
cnf(184,plain,
'==>'('==>'(X,'1'),X) = X,
inference('HYPERRESOLVE',[status(thm)],[4,126,29]) ).
cnf(324,plain,
'>='('==>'('==>'(X,'1'),'1'),X),
inference('PARAMODULATE',[status(thm)],[40,184,theory(equality)]) ).
cnf(508,plain,
'==>'('==>'(X,'1'),'1') = X,
inference('HYPERRESOLVE',[status(thm)],[4,324,75]) ).
cnf(1591,plain,
'>='('==>'('+'(X,Y),Z),'==>'(X,'==>'(Y,Z))),
inference('HYPERRESOLVE',[status(thm)],[5,83]) ).
cnf(1730,plain,
'>='('==>'(X,'==>'(Y,Z)),'==>'('+'(X,Y),Z)),
inference('HYPERRESOLVE',[status(thm)],[5,87]) ).
cnf(3043,plain,
'==>'(X,'==>'(Y,Z)) = '==>'('+'(X,Y),Z),
inference('HYPERRESOLVE',[status(thm)],[4,1730,1591]) ).
cnf(3582,plain,
'>='('==>'('==>'(X,Y),X),X),
inference('PARAMODULATE',[status(thm)],[112,184,theory(equality)]) ).
cnf(3583,plain,
'>='('==>'('==>'(X,Y),'1'),X),
inference('PARAMODULATE',[status(thm)],[112,508,theory(equality)]) ).
cnf(3643,plain,
'==>'('==>'(X,Y),X) = X,
inference('HYPERRESOLVE',[status(thm)],[4,3582,29]) ).
cnf(3646,plain,
'==>'('+'(X,X),Y) = '==>'(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3643,3643,theory(equality)]),3043,theory(equality)]) ).
cnf(3665,plain,
~ '>='('SKOLEMAAAL1','==>'('==>'('SKOLEMAAAL1',X),'1')),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[3,3583,31]),3646,theory(equality)]) ).
cnf(9836,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[3665,75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.07 % Problem : LCL903+1 : TPTP v8.1.0. Released v5.5.0.
% 0.01/0.07 % Command : run-snark %s %d
% 0.07/0.26 % Computer : n014.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Mon Jul 4 04:13:39 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.11/0.33 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.33 *
% 0.11/0.33 *
% 0.11/0.34 #<PACKAGE "SNARK-USER">
% 0.11/0.34 *
% 0.11/0.34 SNARK-TPTP-OPTIONS
% 0.11/0.34 *
% 0.11/0.34 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.11/0.34 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.11/0.34 (USE-FACTORING :POS)
% 0.11/0.34 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.11/0.34 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.11/0.34 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.11/0.34 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.11/0.34 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.11/0.34 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.11/0.34 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.11/0.34 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.11/0.34 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.11/0.34 (DECLARE-TPTP-SYMBOLS2))
% 0.11/0.34 *
% 0.11/0.34 "."
% 0.11/0.34 *
% 0.11/0.34 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T04:13:39
% 0.11/0.34 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-07-04T04:13:39
% 0.11/0.34
% 0.11/0.34 ; Recognized associativity assertion (= (+ (+ ?X ?Y) ?Z) (+ ?X (+ ?Y ?Z))).
% 0.11/0.34 ; Recognized commutativity assertion (= (+ ?X ?Y) (+ ?Y ?X)).
% 0.11/0.34 ; Recognized right identity assertion (= (+ ?X |0|) ?X).
% 0.11/0.34 ; Declaring + to be commutative.
% 27.53/27.70 ; Declaring + to be associative-commutative.
% 27.53/27.70
% 27.53/27.70 #||
% 27.53/27.70 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.53/27.70 % SZS output start Refutation
% See solution above
% 27.53/27.70 ||#
% 27.53/27.70
% 27.53/27.70 ; Summary of computation:
% 27.53/27.70 ; 56244 formulas have been input or derived (from 210 formulas).
% 27.53/27.70 ; 9836 (17%) were retained. Of these,
% 27.53/27.70 ; 1003 (10%) were simplified or subsumed later,
% 27.53/27.70 ; 8833 (90%) are still being kept.
% 27.53/27.70 ;
% 27.53/27.70 ; Run time in seconds excluding printing time:
% 27.53/27.70 ; 0.002 0% Read assertion file (1 call)
% 27.53/27.70 ; 0.000 0% Assert (14 calls)
% 27.53/27.70 ; 1.036 4% Process new row (52,587 calls)
% 27.53/27.70 ; 1.306 5% Resolution (418 calls)
% 27.53/27.70 ; 0.404 1% Paramodulation (209 calls)
% 27.53/27.70 ; 0.025 0% Embedding (100 calls)
% 27.53/27.70 ; 0.002 0% Condensing (58 calls)
% 27.53/27.70 ; 0.000 0% Forward subsumption (58 calls)
% 27.53/27.70 ; 0.000 0% Backward subsumption (32 calls)
% 27.53/27.70 ; 0.002 0% Clause clause subsumption (180 calls)
% 27.53/27.70 ; 21.364 78% Forward simplification (49,957 calls)
% 27.53/27.70 ; 0.796 3% Backward simplification (9,762 calls)
% 27.53/27.70 ; 1.806 7% Ordering (186,761 calls)
% 27.53/27.70 ; 0.436 2% Ordering ac (149,487 calls)
% 27.53/27.70 ; 0.000 0% Sortal reasoning (32 calls)
% 27.53/27.70 ; 0.000 0% Purity testing (1 call)
% 27.53/27.70 ; 0.181 1% Other
% 27.53/27.70 ; 27.360 Total
% 27.53/27.70 ; 27.368 Real time
% 27.53/27.70 ;
% 27.53/27.70 ; Term-hash-array has 22,522 terms in all.
% 27.53/27.70 ; Feature-vector-row-index has 28 entries (28 at peak, 32 added, 4 deleted).
% 27.53/27.70 ; Feature-vector-row-index has 121 nodes (121 at peak, 136 added, 15 deleted).
% 27.53/27.71 ; Retrieved 173 possibly forward subsuming rows in 58 calls.
% 27.53/27.71 ; Retrieved 12 possibly backward subsumed rows in 32 calls.
% 27.53/27.71 ; Path-index has 20,379 entries (20,379 at peak, 22,624 added, 2,245 deleted).
% 27.53/27.71 ; Path-index has 3,918 nodes (3,918 at peak, 4,023 added, 105 deleted).
% 27.53/27.71 ; Trie-index has 20,379 entries (20,379 at peak, 22,624 added, 2,245 deleted).
% 27.53/27.71 ; Trie-index has 7,932 nodes (7,932 at peak, 8,506 added, 574 deleted).
% 27.53/27.71 ; Retrieved 12,321,347 generalization terms in 237,336 calls.
% 27.53/27.71 ; Retrieved 111,111 instance terms in 9,755 calls.
% 27.53/27.71 ; Retrieved 862,552 unifiable terms in 15,536 calls.
% 27.53/27.71 ;
% 27.53/27.71 ; The agenda of rows to process has 70 entries:
% 27.53/27.71 ; 4 with value 13 4 with value 23 9 with value 28
% 27.53/27.71 ; 5 with value 16 5 with value 24 2 with value 29
% 27.53/27.71 ; 9 with value 19 7 with value 25 2 with value 30
% 27.53/27.71 ; 3 with value 21 11 with value 26 1 with value 31
% 27.53/27.71 ; 6 with value 22 2 with value 27
% 27.53/27.71 ; The agenda of rows to give has 8649 entries:
% 27.53/27.71 ; 1 with value (4 18) 656 with value (4 30) 9 with value (4 42)
% 27.53/27.71 ; 84 with value (4 19) 259 with value (4 31) 7 with value (4 43)
% 27.53/27.71 ; 133 with value (4 20) 221 with value (4 32) 5 with value (4 44)
% 27.53/27.71 ; 288 with value (4 21) 121 with value (4 33) 1 with value (4 45)
% 27.53/27.71 ; 439 with value (4 22) 111 with value (4 34) 3 with value (4 46)
% 27.53/27.71 ; 576 with value (4 23) 68 with value (4 35) 2 with value (4 47)
% 27.53/27.71 ; 995 with value (4 24) 82 with value (4 36) 2 with value (4 48)
% 27.53/27.71 ; 868 with value (4 25) 65 with value (4 37) 6 with value (4 49)
% 27.53/27.71 ; 663 with value (4 26) 35 with value (4 38) 1 with value (4 50)
% 27.53/27.71 ; 1056 with value (4 27) 28 with value (4 39) 1 with value (4 52)
% 27.53/27.71 ; 1006 with value (4 28) 26 with value (4 40) 2 with value (4 53)
% 27.53/27.71 ; 796 with value (4 29) 29 with value (4 41) 4 with value (4 57)
% 27.53/27.71 Evaluation took:
% 27.53/27.71 27.369 seconds of real time
% 27.53/27.71 26.636564 seconds of user run time
% 27.53/27.71 0.72786 seconds of system run time
% 27.53/27.71 [Run times include 1.745 seconds GC run time.]
% 27.53/27.71 0 calls to %EVAL
% 27.53/27.71 0 page faults and
% 27.53/27.71 2,308,494,168 bytes consed.
% 27.53/27.71 :PROOF-FOUND
% 27.53/27.71 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T04:14:06
% 27.53/27.71 :PROOF-FOUND
% 27.53/27.71 *
%------------------------------------------------------------------------------