TSTP Solution File: SYO666-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SYO666-1 : 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 : Thu Jul 21 19:44:52 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 6 unt; 16 nHn; 19 RR)
% Number of literals : 86 ( 0 equ; 43 neg)
% Maximal clause size : 17 ( 3 avg)
% Maximal term depth : 4 ( 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 : 25 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_102,axiom,
( ~ iLEQ(suc(X),suc(Y))
| ~ 'E'('0',f(suc(Z)))
| ~ 'E'('0',f(suc(X)))
| ~ iLEQ(suc(Y),suc(U))
| ~ 'E'('0',f(suc(Y)))
| ~ 'E'('0',f(Z))
| ~ 'E'('0',f(suc(V)))
| ~ 'E'('0',f(Y))
| ~ iLEQ(suc(W),suc(X))
| ~ 'E'('0',f(X))
| ~ iLEQ(suc(V),suc(W))
| ~ 'E'('0',f(suc(U)))
| ~ 'E'('0',f(V))
| ~ iLEQ(suc(Z),suc(V))
| ~ 'E'('0',f(suc(W)))
| ~ 'E'('0',f(U))
| ~ 'E'('0',f(W)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_102) ).
cnf(clause_12,axiom,
( ~ 'E'('0',f(X))
| ~ 'E'('0',f(suc(X)))
| iLEQ(suc(X),suc(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_12) ).
cnf(clause_98,axiom,
~ 'LE'(f(z),'0'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_98) ).
cnf(clause_123,axiom,
( ~ 'LE'(f(suc(X)),s('0'))
| 'E'('0',f(suc(X)))
| 'LE'(f(X),'0') ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_123) ).
cnf(clause_42,axiom,
( ~ 'LE'(f(X),s('0'))
| 'E'('0',f(X))
| 'LE'(f(X),'0') ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_42) ).
cnf(clause_83,axiom,
'LE'(f(X),s(s('0'))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_83) ).
cnf(clause_70,axiom,
( ~ 'E'(s('0'),f(X))
| ~ 'E'(s('0'),f(suc(X)))
| iLEQ(suc(X),suc(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_70) ).
cnf(clause_29,axiom,
( ~ 'LE'(f(suc(X)),s(s('0')))
| 'E'(s('0'),f(suc(X)))
| 'LE'(f(X),s('0')) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_29) ).
cnf(9,plain,
( 'E'(s('0'),f(suc(X)))
| 'LE'(f(X),s('0')) ),
inference('REWRITE',[status(thm)],[clause_29,clause_83]) ).
cnf(clause_185,axiom,
( ~ 'LE'(f(X),s(s('0')))
| 'E'(s('0'),f(X))
| 'LE'(f(X),s('0')) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_185) ).
cnf(11,plain,
( 'E'(s('0'),f(X))
| 'LE'(f(X),s('0')) ),
inference('REWRITE',[status(thm)],[clause_185,clause_83]) ).
cnf(clause_179,axiom,
( ~ 'E'(s('0'),f(X))
| ~ iLEQ(suc(Y),suc(Z))
| ~ 'E'(s('0'),f(U))
| ~ 'E'(s('0'),f(suc(U)))
| ~ iLEQ(suc(V),suc(Y))
| ~ 'E'(s('0'),f(Y))
| ~ 'E'(s('0'),f(suc(Y)))
| ~ iLEQ(suc(X),suc(V))
| ~ 'E'(s('0'),f(suc(X)))
| ~ iLEQ(suc(Z),suc(W))
| ~ 'E'(s('0'),f(suc(V)))
| ~ 'E'(s('0'),f(W))
| ~ 'E'(s('0'),f(suc(Z)))
| ~ iLEQ(suc(U),suc(X))
| ~ 'E'(s('0'),f(V))
| ~ 'E'(s('0'),f(Z))
| ~ 'E'(s('0'),f(suc(W))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_179) ).
cnf(13,plain,
( 'E'(s('0'),f(X))
| 'E'('0',f(X))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_42,11]) ).
cnf(14,plain,
( 'E'(s('0'),f(suc(X)))
| 'E'('0',f(X))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_42,9]) ).
cnf(15,plain,
( 'E'(s('0'),f(suc(X)))
| 'E'('0',f(suc(X)))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_123,11]) ).
cnf(16,plain,
( 'E'(s('0'),f(suc(suc(X))))
| 'E'('0',f(suc(X)))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_123,9]) ).
cnf(17,plain,
( 'E'(s('0'),f(z))
| 'E'('0',f(z)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_98,13]) ).
cnf(18,plain,
( 'E'(s('0'),f(suc(z)))
| 'E'('0',f(z)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_98,14]) ).
cnf(19,plain,
( 'E'('0',f(z))
| iLEQ(suc(z),suc(z)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_70,18,17]) ).
cnf(20,plain,
'E'('0',f(z)),
inference('HYPERRESOLVE',[status(thm)],[clause_179,19,17,17,18,19,17,18,19,18,19,18,17,18,19,17,17,18]) ).
cnf(21,plain,
( 'E'(s('0'),f(suc(z)))
| 'E'('0',f(suc(z))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_98,15]) ).
cnf(22,plain,
( 'E'(s('0'),f(suc(suc(z))))
| 'E'('0',f(suc(z))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_98,16]) ).
cnf(23,plain,
( 'E'('0',f(suc(z)))
| iLEQ(suc(suc(z)),suc(suc(z))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_70,22,21]) ).
cnf(24,plain,
'E'('0',f(suc(z))),
inference('HYPERRESOLVE',[status(thm)],[clause_179,23,21,21,22,23,21,22,23,22,23,22,21,22,23,21,21,22]) ).
cnf(25,plain,
iLEQ(suc(z),suc(z)),
inference('HYPERRESOLVE',[status(thm)],[clause_12,24,20]) ).
cnf(26,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[clause_102,24,24,24,20,24,20,20,24,20,24,20,20]),25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYO666-1 : TPTP v8.1.0. Released v7.3.0.
% 0.10/0.12 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 9 12:50:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 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-09T12:50:40
% 0.19/0.46 ; 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-09T12:50:40
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 #||
% 0.19/0.50 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.50 % SZS output start Refutation
% See solution above
% 0.19/0.51 ||#
% 0.19/0.51
% 0.19/0.51 ; Summary of computation:
% 0.19/0.51 ; 40 formulas have been input or derived (from 23 formulas).
% 0.19/0.51 ; 26 (65%) were retained. Of these,
% 0.19/0.51 ; 8 (31%) were simplified or subsumed later,
% 0.19/0.51 ; 18 (69%) are still being kept.
% 0.19/0.51 ;
% 0.19/0.51 ; Run time in seconds excluding printing time:
% 0.19/0.51 ; 0.005 12% Read assertion file (1 call)
% 0.19/0.51 ; 0.001 2% Assert (10 calls)
% 0.19/0.51 ; 0.003 7% Process new row (24 calls)
% 0.19/0.51 ; 0.006 14% Resolution (44 calls)
% 0.19/0.51 ; 0.001 2% Paramodulation (22 calls)
% 0.19/0.51 ; 0.000 0% Factoring (12 calls)
% 0.19/0.51 ; 0.004 9% Condensing (18 calls)
% 0.19/0.51 ; 0.001 2% Forward subsumption (18 calls)
% 0.19/0.51 ; 0.000 0% Backward subsumption (18 calls)
% 0.19/0.51 ; 0.000 0% Clause clause subsumption (10 calls)
% 0.19/0.51 ; 0.000 0% Forward simplification (24 calls)
% 0.19/0.51 ; 0.001 2% Backward simplification (24 calls)
% 0.19/0.51 ; 0.000 0% Ordering (24 calls)
% 0.19/0.51 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.51 ; 0.000 0% Purity testing (1 call)
% 0.19/0.51 ; 0.021 49% Other
% 0.19/0.51 ; 0.043 Total
% 0.19/0.51 ; 0.049 Real time
% 0.19/0.51 ;
% 0.19/0.51 ; Term-hash-array has 75 terms in all.
% 0.19/0.51 ; Feature-vector-row-index has 12 entries (15 at peak, 18 added, 6 deleted).
% 0.19/0.51 ; Feature-vector-row-index has 90 nodes (125 at peak, 155 added, 65 deleted).
% 0.19/0.51 ; Retrieved 8 possibly forward subsuming rows in 18 calls.
% 0.19/0.51 ; Retrieved 2 possibly backward subsumed rows in 18 calls.
% 0.19/0.51 ; Path-index has 71 entries (75 at peak, 81 added, 10 deleted).
% 0.19/0.51 ; Path-index has 58 nodes (61 at peak, 68 added, 10 deleted).
% 0.19/0.51 ; Trie-index has 71 entries (75 at peak, 81 added, 10 deleted).
% 0.19/0.51 ; Trie-index has 58 nodes (64 at peak, 74 added, 16 deleted).
% 0.19/0.51 ; Retrieved 3 generalization terms in 20 calls.
% 0.19/0.51 ; Retrieved 5 instance terms in 5 calls.
% 0.19/0.51 ; Retrieved 1,670 unifiable terms in 675 calls.
% 0.19/0.51 ;
% 0.19/0.51 ; The agenda of rows to process has 2 entries:
% 0.19/0.51 ; 2 with value 12
% 0.19/0.51 ; The agenda of rows to give has 1 entry:
% 0.19/0.51 ; 1 with value (4 12)
% 0.19/0.51 Evaluation took:
% 0.19/0.51 0.049 seconds of real time
% 0.19/0.51 0.045051 seconds of user run time
% 0.19/0.51 0.004155 seconds of system run time
% 0.19/0.51 0 calls to %EVAL
% 0.19/0.51 0 page faults and
% 0.19/0.51 5,769,120 bytes consed.
% 0.19/0.51 :PROOF-FOUND
% 0.19/0.51 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-09T12:50:41
% 0.19/0.51 :PROOF-FOUND
% 0.19/0.51 *
%------------------------------------------------------------------------------