TSTP Solution File: SYO664-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SYO664-1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n009.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.22s 0.53s
% Output : Refutation 0.22s
% 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 : 80 ( 0 equ; 37 neg)
% Maximal clause size : 14 ( 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 : 23 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_37,axiom,
( ~ 'E'(s('0'),f(suc(X)))
| ~ 'E'(s('0'),f(X))
| ~ 'E'(s('0'),f(suc(Y)))
| ~ 'E'(s('0'),f(suc(Z)))
| ~ 'E'(s('0'),f(U))
| ~ 'E'(s('0'),f(suc(U)))
| ~ iLEQ(suc(U),suc(Z))
| ~ 'E'(s('0'),f(Z))
| ~ iLEQ(suc(V),suc(X))
| ~ 'E'(s('0'),f(Y))
| ~ 'E'(s('0'),f(V))
| ~ iLEQ(suc(X),suc(Y))
| ~ iLEQ(suc(Z),suc(V))
| ~ 'E'(s('0'),f(suc(V))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_37) ).
cnf(clause_70,axiom,
~ 'LE'(f(z),'0'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_70) ).
cnf(clause_20,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_20) ).
cnf(clause_66,axiom,
( ~ 'E'('0',f(X))
| ~ 'E'('0',f(suc(Y)))
| ~ 'E'('0',f(suc(Z)))
| ~ iLEQ(suc(Z),suc(Y))
| ~ iLEQ(suc(Y),suc(U))
| ~ 'E'('0',f(suc(X)))
| ~ 'E'('0',f(Z))
| ~ iLEQ(suc(U),suc(X))
| ~ 'E'('0',f(V))
| ~ iLEQ(suc(X),suc(V))
| ~ 'E'('0',f(suc(U)))
| ~ 'E'('0',f(Y))
| ~ 'E'('0',f(suc(V)))
| ~ 'E'('0',f(U)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_66) ).
cnf(clause_58,axiom,
'LE'(f(X),s(s('0'))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_58) ).
cnf(clause_6,axiom,
( ~ 'E'('0',f(X))
| ~ 'E'('0',f(suc(X)))
| iLEQ(suc(X),suc(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_117,axiom,
( ~ 'LE'(f(suc(X)),s('0'))
| 'E'('0',f(suc(X)))
| 'LE'(f(X),'0') ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_117) ).
cnf(clause_94,axiom,
( ~ 'LE'(f(X),s('0'))
| 'E'('0',f(X))
| 'LE'(f(X),'0') ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_94) ).
cnf(clause_50,axiom,
( ~ 'E'(s('0'),f(X))
| ~ 'E'(s('0'),f(suc(X)))
| iLEQ(suc(X),suc(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_50) ).
cnf(clause_83,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_83) ).
cnf(11,plain,
( 'E'(s('0'),f(suc(X)))
| 'LE'(f(X),s('0')) ),
inference('REWRITE',[status(thm)],[clause_83,clause_58]) ).
cnf(12,plain,
( 'E'(s('0'),f(X))
| 'LE'(f(X),s('0')) ),
inference('REWRITE',[status(thm)],[clause_20,clause_58]) ).
cnf(13,plain,
( 'E'(s('0'),f(X))
| 'E'('0',f(X))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_94,12]) ).
cnf(14,plain,
( 'E'(s('0'),f(suc(X)))
| 'E'('0',f(X))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_94,11]) ).
cnf(15,plain,
( 'E'(s('0'),f(suc(X)))
| 'E'('0',f(suc(X)))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_117,12]) ).
cnf(16,plain,
( 'E'(s('0'),f(suc(suc(X))))
| 'E'('0',f(suc(X)))
| 'LE'(f(X),'0') ),
inference('HYPERRESOLVE',[status(thm)],[clause_117,11]) ).
cnf(17,plain,
( 'E'(s('0'),f(z))
| 'E'('0',f(z)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_70,13]) ).
cnf(18,plain,
( 'E'(s('0'),f(suc(z)))
| 'E'('0',f(z)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_70,14]) ).
cnf(19,plain,
( 'E'('0',f(z))
| iLEQ(suc(z),suc(z)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_50,18,17]) ).
cnf(20,plain,
'E'('0',f(z)),
inference('HYPERRESOLVE',[status(thm)],[clause_37,19,18,17,18,18,17,18,17,19,17,17,19,19,18]) ).
cnf(21,plain,
( 'E'(s('0'),f(suc(z)))
| 'E'('0',f(suc(z))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_70,15]) ).
cnf(22,plain,
( 'E'(s('0'),f(suc(suc(z))))
| 'E'('0',f(suc(z))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_70,16]) ).
cnf(23,plain,
( 'E'('0',f(suc(z)))
| iLEQ(suc(suc(z)),suc(suc(z))) ),
inference('HYPERRESOLVE',[status(thm)],[clause_50,22,21]) ).
cnf(24,plain,
'E'('0',f(suc(z))),
inference('HYPERRESOLVE',[status(thm)],[clause_37,23,22,21,22,22,21,22,21,23,21,21,23,23,22]) ).
cnf(25,plain,
iLEQ(suc(z),suc(z)),
inference('HYPERRESOLVE',[status(thm)],[clause_6,24,20]) ).
cnf(26,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[clause_66,24,20,24,24,20,20,24,20,24,20]),25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO664-1 : TPTP v8.1.0. Released v7.3.0.
% 0.13/0.13 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jul 8 20:17:37 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.22/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.48 *
% 0.22/0.48 *
% 0.22/0.49 #<PACKAGE "SNARK-USER">
% 0.22/0.49 *
% 0.22/0.49 SNARK-TPTP-OPTIONS
% 0.22/0.49 *
% 0.22/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.49 (USE-FACTORING :POS)
% 0.22/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.49 *
% 0.22/0.49 "."
% 0.22/0.49 *
% 0.22/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-08T20:17:37
% 0.22/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n009.cluster.edu at 2022-07-08T20:17:37
% 0.22/0.53
% 0.22/0.53
% 0.22/0.53 #||
% 0.22/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.53 % SZS output start Refutation
% See solution above
% 0.22/0.54 ||#
% 0.22/0.54
% 0.22/0.54 ; Summary of computation:
% 0.22/0.54 ; 37 formulas have been input or derived (from 23 formulas).
% 0.22/0.54 ; 26 (70%) were retained. Of these,
% 0.22/0.54 ; 8 (31%) were simplified or subsumed later,
% 0.22/0.54 ; 18 (69%) are still being kept.
% 0.22/0.54 ;
% 0.22/0.54 ; Run time in seconds excluding printing time:
% 0.22/0.54 ; 0.004 9% Read assertion file (1 call)
% 0.22/0.54 ; 0.001 2% Assert (10 calls)
% 0.22/0.54 ; 0.002 5% Process new row (25 calls)
% 0.22/0.54 ; 0.008 18% Resolution (44 calls)
% 0.22/0.54 ; 0.000 0% Paramodulation (22 calls)
% 0.22/0.54 ; 0.000 0% Factoring (12 calls)
% 0.22/0.54 ; 0.002 5% Condensing (19 calls)
% 0.22/0.54 ; 0.001 2% Forward subsumption (19 calls)
% 0.22/0.54 ; 0.000 0% Backward subsumption (19 calls)
% 0.22/0.54 ; 0.000 0% Clause clause subsumption (10 calls)
% 0.22/0.54 ; 0.001 2% Forward simplification (25 calls)
% 0.22/0.54 ; 0.001 2% Backward simplification (25 calls)
% 0.22/0.54 ; 0.001 2% Ordering (24 calls)
% 0.22/0.54 ; 0.000 0% Sortal reasoning (32 calls)
% 0.22/0.54 ; 0.000 0% Purity testing (1 call)
% 0.22/0.54 ; 0.023 52% Other
% 0.22/0.54 ; 0.044 Total
% 0.22/0.54 ; 0.049 Real time
% 0.22/0.54 ;
% 0.22/0.54 ; Term-hash-array has 66 terms in all.
% 0.22/0.54 ; Feature-vector-row-index has 12 entries (15 at peak, 19 added, 7 deleted).
% 0.22/0.54 ; Feature-vector-row-index has 79 nodes (114 at peak, 160 added, 81 deleted).
% 0.22/0.54 ; Retrieved 8 possibly forward subsuming rows in 19 calls.
% 0.22/0.54 ; Retrieved 2 possibly backward subsumed rows in 19 calls.
% 0.22/0.54 ; Path-index has 62 entries (66 at peak, 73 added, 11 deleted).
% 0.22/0.54 ; Path-index has 58 nodes (61 at peak, 69 added, 11 deleted).
% 0.22/0.54 ; Trie-index has 62 entries (66 at peak, 73 added, 11 deleted).
% 0.22/0.54 ; Trie-index has 58 nodes (64 at peak, 75 added, 17 deleted).
% 0.22/0.54 ; Retrieved 2 generalization terms in 21 calls.
% 0.22/0.54 ; Retrieved 5 instance terms in 5 calls.
% 0.22/0.54 ; Retrieved 2,189 unifiable terms in 862 calls.
% 0.22/0.54 ;
% 0.22/0.54 ; The agenda of rows to process has 2 entries:
% 0.22/0.54 ; 2 with value 12
% 0.22/0.54 ; The agenda of rows to give has 1 entry:
% 0.22/0.54 ; 1 with value (4 12)
% 0.22/0.54 Evaluation took:
% 0.22/0.54 0.049 seconds of real time
% 0.22/0.54 0.043139 seconds of user run time
% 0.22/0.54 0.006029 seconds of system run time
% 0.22/0.54 0 calls to %EVAL
% 0.22/0.54 0 page faults and
% 0.22/0.54 5,470,008 bytes consed.
% 0.22/0.54 :PROOF-FOUND
% 0.22/0.54 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-08T20:17:37
% 0.22/0.54 :PROOF-FOUND
% 0.22/0.54 *
%------------------------------------------------------------------------------