TSTP Solution File: SYO657-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SYO657-1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n005.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 : Thu Jul 21 19:44:49 EDT 2022
% Result : Unsatisfiable 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 53 ( 8 unt; 41 nHn; 40 RR)
% Number of literals : 150 ( 0 equ; 47 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 31 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_10,axiom,
( ~ 'E'('0',f(suc(X)))
| ~ 'E'('0',f(X))
| ~ iLEQ(suc(X),suc(Y))
| ~ 'E'('0',f(Y))
| ~ 'E'('0',f(suc(Y)))
| 'E'(f(X),f(suc(X)))
| 'E'(f(Y),f(suc(Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_45,axiom,
( ~ 'LE'(f(suc(suc(X))),s(s('0')))
| 'E'(s('0'),f(suc(suc(X))))
| 'LE'(f(X),s('0')) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_45) ).
cnf(clause_17,axiom,
'LE'(f(X),s(s('0'))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_17) ).
cnf(clause_23,axiom,
( ~ 'E'(s('0'),f(X))
| ~ 'E'(s('0'),f(suc(X)))
| 'E'(f(X),f(suc(X)))
| iLEQ(suc(X),suc(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_23) ).
cnf(clause_9,axiom,
( ~ 'LE'(f(X),s(s('0')))
| 'E'(s('0'),f(X))
| 'LE'(f(X),s('0')) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(8,plain,
( 'E'(s('0'),f(X))
| 'LE'(f(X),s('0')) ),
inference('REWRITE',[status(thm)],[clause_9,clause_17]) ).
cnf(clause_34,axiom,
( ~ 'LE'(f(X),s('0'))
| 'E'('0',f(X))
| 'LE'(f(X),'0') ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_34) ).
cnf(clause_41,axiom,
( ~ 'E'('0',f(suc(suc(X))))
| ~ 'E'('0',f(suc(X)))
| ~ 'E'(f(X),f(suc(X)))
| ~ 'E'('0',f(X))
| iLEQ(suc(X),suc(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_41) ).
cnf(clause_26,axiom,
( ~ 'E'('0',f(X))
| ~ 'E'('0',f(suc(X)))
| 'E'(f(X),f(suc(X)))
| iLEQ(suc(X),suc(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_26) ).
cnf(clause_43,axiom,
( ~ 'E'('0',f(suc(X)))
| ~ 'E'('0',f(suc(suc(Y))))
| ~ 'E'('0',f(suc(suc(X))))
| ~ 'E'('0',f(X))
| ~ iLEQ(suc(X),suc(Y))
| ~ 'E'('0',f(Y))
| ~ 'E'(f(X),f(suc(X)))
| ~ 'E'(f(Y),f(suc(Y)))
| ~ 'E'('0',f(suc(Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_43) ).
cnf(clause_40,axiom,
( ~ 'LE'(f(suc(X)),s('0'))
| 'E'('0',f(suc(X)))
| 'LE'(f(X),'0') ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_40) ).
cnf(clause_51,axiom,
( ~ 'LE'(f(suc(suc(X))),s('0'))
| 'E'('0',f(suc(suc(X))))
| 'LE'(f(X),'0') ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_51) ).
cnf(clause_24,axiom,
~ 'LE'(f(z),'0'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_24) ).
cnf(clause_32,axiom,
( ~ 'LE'(f(suc(X)),s(s('0')))
| 'E'(s('0'),f(suc(X)))
| 'LE'(f(X),s('0')) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_32) ).
cnf(18,plain,
( 'E'(s('0'),f(suc(X)))
| 'LE'(f(X),s('0')) ),
inference('REWRITE',[status(thm)],[clause_32,clause_17]) ).
cnf(clause_52,axiom,
( ~ iLEQ(suc(X),suc(Y))
| ~ 'E'(s('0'),f(X))
| ~ 'E'(s('0'),f(suc(X)))
| ~ 'E'(s('0'),f(suc(Y)))
| ~ 'E'(s('0'),f(Y))
| 'E'(f(X),f(suc(X)))
| 'E'(f(Y),f(suc(Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_52) ).
cnf(clause_5,axiom,
( ~ 'E'(s('0'),f(suc(suc(X))))
| ~ 'E'(s('0'),f(suc(X)))
| ~ 'E'(f(X),f(suc(X)))
| ~ 'E'(s('0'),f(X))
| iLEQ(suc(X),suc(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_33,axiom,
( ~ iLEQ(suc(X),suc(Y))
| ~ 'E'(s('0'),f(suc(suc(X))))
| ~ 'E'(s('0'),f(X))
| ~ 'E'(s('0'),f(suc(suc(Y))))
| ~ 'E'(s('0'),f(suc(X)))
| ~ 'E'(s('0'),f(suc(Y)))
| ~ 'E'(s('0'),f(Y))
| ~ 'E'(f(Y),f(suc(Y)))
| ~ 'E'(f(X),f(suc(X))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_33) ).
cnf(23,plain,
( 'E'(s('0'),f(suc(suc(X))))
| 'LE'(f(X),s('0')) ),
inference('REWRITE',[status(thm)],[clause_45,clause_17]) ).
cnf(24,plain,
( 'E'(s('0'),f(X))
| 'E'('0',f(X))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_34,8]) ).
cnf(25,plain,
( 'E'(s('0'),f(suc(X)))
| 'E'('0',f(X))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_34,18]) ).
cnf(26,plain,
( 'E'(s('0'),f(suc(suc(X))))
| 'E'('0',f(X))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_34,23]) ).
cnf(27,plain,
( 'E'(s('0'),f(suc(X)))
| 'E'('0',f(suc(X)))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_40,8]) ).
cnf(28,plain,
( 'E'(s('0'),f(suc(suc(X))))
| 'E'('0',f(suc(X)))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_40,18]) ).
cnf(29,plain,
( 'E'(s('0'),f(suc(suc(suc(X)))))
| 'E'('0',f(suc(X)))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_40,23]) ).
cnf(30,plain,
( 'E'(s('0'),f(suc(suc(X))))
| 'E'('0',f(suc(suc(X))))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_51,8]) ).
cnf(31,plain,
( 'E'(s('0'),f(suc(suc(suc(X)))))
| 'E'('0',f(suc(suc(X))))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_51,18]) ).
cnf(32,plain,
( 'E'(s('0'),f(suc(suc(suc(suc(X))))))
| 'E'('0',f(suc(suc(X))))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_51,23]) ).
cnf(33,plain,
( 'E'(s('0'),f(z))
| 'E'('0',f(z)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_24,24]) ).
cnf(34,plain,
( 'E'(s('0'),f(suc(z)))
| 'E'('0',f(z)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_24,25]) ).
cnf(35,plain,
( 'E'('0',f(z))
| 'E'(f(z),f(suc(z)))
| iLEQ(suc(z),suc(z)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_23,34,33]) ).
cnf(36,plain,
( 'E'(s('0'),f(suc(suc(z))))
| 'E'('0',f(z)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_24,26]) ).
cnf(38,plain,
( 'E'(s('0'),f(suc(z)))
| 'E'('0',f(suc(z))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_24,27]) ).
cnf(39,plain,
( 'E'('0',f(z))
| 'E'(f(z),f(suc(z))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_52,35,33,34,34,33]) ).
cnf(40,plain,
( 'E'('0',f(z))
| iLEQ(suc(z),suc(z)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_5,39,36,34,33]) ).
cnf(41,plain,
'E'('0',f(z)),
inference('HYPERRESOLVE',[status(thm)],[clause_33,40,36,33,36,34,34,33,39,39]) ).
cnf(42,plain,
( 'E'(s('0'),f(suc(suc(z))))
| 'E'('0',f(suc(z))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_24,28]) ).
cnf(43,plain,
( 'E'('0',f(suc(z)))
| 'E'(f(suc(z)),f(suc(suc(z))))
| iLEQ(suc(suc(z)),suc(suc(z))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_23,42,38]) ).
cnf(44,plain,
( 'E'(s('0'),f(suc(suc(suc(z)))))
| 'E'('0',f(suc(z))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_24,29]) ).
cnf(46,plain,
( 'E'(s('0'),f(suc(suc(z))))
| 'E'('0',f(suc(suc(z)))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_24,30]) ).
cnf(47,plain,
( 'E'(s('0'),f(suc(suc(suc(z)))))
| 'E'('0',f(suc(suc(z)))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_24,31]) ).
cnf(48,plain,
( 'E'('0',f(suc(suc(z))))
| 'E'(f(suc(suc(z))),f(suc(suc(suc(z)))))
| iLEQ(suc(suc(suc(z))),suc(suc(suc(z)))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_23,47,46]) ).
cnf(49,plain,
( 'E'(s('0'),f(suc(suc(suc(suc(z))))))
| 'E'('0',f(suc(suc(z)))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_24,32]) ).
cnf(51,plain,
( 'E'('0',f(suc(z)))
| 'E'(f(suc(z)),f(suc(suc(z)))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_52,43,38,42,42,38]) ).
cnf(52,plain,
( 'E'('0',f(suc(z)))
| iLEQ(suc(suc(z)),suc(suc(z))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_5,51,44,42,38]) ).
cnf(53,plain,
'E'('0',f(suc(z))),
inference('HYPERRESOLVE',[status(thm)],[clause_33,52,44,38,44,42,42,38,51,51]) ).
cnf(54,plain,
( 'E'(f(z),f(suc(z)))
| iLEQ(suc(z),suc(z)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_26,53,41]) ).
cnf(55,plain,
'E'(f(z),f(suc(z))),
inference('HYPERRESOLVE',[status(thm)],[clause_10,54,53,41,41,53]) ).
cnf(56,plain,
( 'E'('0',f(suc(suc(z))))
| 'E'(f(suc(suc(z))),f(suc(suc(suc(z))))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_52,48,46,47,47,46]) ).
cnf(57,plain,
( 'E'('0',f(suc(suc(z))))
| iLEQ(suc(suc(suc(z))),suc(suc(suc(z)))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_5,56,49,47,46]) ).
cnf(58,plain,
'E'('0',f(suc(suc(z)))),
inference('HYPERRESOLVE',[status(thm)],[clause_33,57,49,46,49,47,47,46,56,56]) ).
cnf(59,plain,
iLEQ(suc(z),suc(z)),
inference('HYPERRESOLVE',[status(thm)],[clause_41,58,53,55,41]) ).
cnf(60,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[clause_43,58,53,58,41,41,55,55,53]),59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO657-1 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n005.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 : Sat Jul 9 14:15:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/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.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-09T14:15:37
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n005.cluster.edu at 2022-07-09T14:15:37
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 #||
% 0.19/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.53 % SZS output start Refutation
% See solution above
% 0.19/0.54 ||#
% 0.19/0.54
% 0.19/0.54 ; Summary of computation:
% 0.19/0.54 ; 132 formulas have been input or derived (from 53 formulas).
% 0.19/0.54 ; 60 (45%) were retained. Of these,
% 0.19/0.54 ; 25 (42%) were simplified or subsumed later,
% 0.19/0.54 ; 35 (58%) are still being kept.
% 0.19/0.54 ;
% 0.19/0.54 ; Run time in seconds excluding printing time:
% 0.19/0.54 ; 0.008 12% Read assertion file (1 call)
% 0.19/0.54 ; 0.002 3% Assert (20 calls)
% 0.19/0.54 ; 0.010 15% Process new row (75 calls)
% 0.19/0.54 ; 0.013 20% Resolution (104 calls)
% 0.19/0.54 ; 0.002 3% Paramodulation (52 calls)
% 0.19/0.54 ; 0.000 0% Factoring (31 calls)
% 0.19/0.54 ; 0.000 0% Condensing (58 calls)
% 0.19/0.54 ; 0.001 2% Forward subsumption (58 calls)
% 0.19/0.54 ; 0.000 0% Backward subsumption (50 calls)
% 0.19/0.54 ; 0.000 0% Clause clause subsumption (77 calls)
% 0.19/0.54 ; 0.002 3% Forward simplification (66 calls)
% 0.19/0.54 ; 0.002 3% Backward simplification (58 calls)
% 0.19/0.54 ; 0.002 3% Ordering (80 calls)
% 0.19/0.54 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.54 ; 0.000 0% Purity testing (1 call)
% 0.19/0.54 ; 0.024 36% Other
% 0.19/0.54 ; 0.066 Total
% 0.19/0.54 ; 0.076 Real time
% 0.19/0.54 ;
% 0.19/0.54 ; Term-hash-array has 66 terms in all.
% 0.19/0.54 ; Feature-vector-row-index has 27 entries (38 at peak, 50 added, 23 deleted).
% 0.19/0.54 ; Feature-vector-row-index has 185 nodes (298 at peak, 422 added, 237 deleted).
% 0.19/0.54 ; Retrieved 69 possibly forward subsuming rows in 58 calls.
% 0.19/0.54 ; Retrieved 15 possibly backward subsumed rows in 50 calls.
% 0.19/0.54 ; Path-index has 52 entries (64 at peak, 86 added, 34 deleted).
% 0.19/0.54 ; Path-index has 85 nodes (97 at peak, 126 added, 41 deleted).
% 0.19/0.54 ; Trie-index has 52 entries (64 at peak, 86 added, 34 deleted).
% 0.19/0.54 ; Trie-index has 88 nodes (128 at peak, 204 added, 116 deleted).
% 0.19/0.54 ; Retrieved 3 generalization terms in 64 calls.
% 0.19/0.54 ; Retrieved 8 instance terms in 7 calls.
% 0.19/0.54 ; Retrieved 3,806 unifiable terms in 1,574 calls.
% 0.19/0.54 ;
% 0.19/0.54 ; The agenda of rows to process has 2 entries:
% 0.19/0.54 ; 1 with value 16 1 with value 29
% 0.19/0.54 ; The agenda of rows to give has 1 entry:
% 0.19/0.54 ; 1 with value (4 16)
% 0.19/0.54 Evaluation took:
% 0.19/0.54 0.077 seconds of real time
% 0.19/0.54 0.065247 seconds of user run time
% 0.19/0.54 0.010916 seconds of system run time
% 0.19/0.54 0 calls to %EVAL
% 0.19/0.54 0 page faults and
% 0.19/0.54 10,122,104 bytes consed.
% 0.19/0.54 :PROOF-FOUND
% 0.19/0.54 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-09T14:15:37
% 0.19/0.54 :PROOF-FOUND
% 0.19/0.54 *
%------------------------------------------------------------------------------