TSTP Solution File: KRS010-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KRS010-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n025.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 03:28:21 EDT 2022
% Result : Unsatisfiable 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 33 ( 16 unt; 8 nHn; 33 RR)
% Number of literals : 60 ( 0 equ; 27 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_2,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_3,axiom,
( c(X)
| d(X)
| ~ a(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_6,axiom,
( equalish(X,Y)
| ~ e(Z)
| ~ r(Z,X)
| ~ r(Z,Y)
| ~ c(X)
| ~ c(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_7,axiom,
( r3least(X)
| ~ e(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_8,axiom,
( a(X)
| ~ e(Y)
| ~ r(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_19,axiom,
( ~ r3least(X)
| ~ equalish(u2r2(X),u2r1(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_19) ).
cnf(clause_20,axiom,
( ~ r3least(X)
| ~ equalish(u2r3(X),u2r1(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_20) ).
cnf(clause_21,axiom,
( ~ r3least(X)
| ~ equalish(u2r3(X),u2r2(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_21) ).
cnf(clause_22,axiom,
( r(X,u2r1(X))
| ~ r3least(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_22) ).
cnf(clause_23,axiom,
( r(X,u2r2(X))
| ~ r3least(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_23) ).
cnf(clause_24,axiom,
( r(X,u2r3(X))
| ~ r3least(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_24) ).
cnf(clause_31,axiom,
( f(X)
| equalish(Y,Z)
| ~ r(X,Y)
| ~ r(X,Z)
| ~ d(Y)
| ~ d(Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_31) ).
cnf(32,plain,
r3least(exist),
inference('HYPERRESOLVE',[status(thm)],[clause_7,clause_1]) ).
cnf(33,plain,
r(exist,u2r3(exist)),
inference('HYPERRESOLVE',[status(thm)],[clause_24,32]) ).
cnf(34,plain,
r(exist,u2r2(exist)),
inference('HYPERRESOLVE',[status(thm)],[clause_23,32]) ).
cnf(35,plain,
r(exist,u2r1(exist)),
inference('HYPERRESOLVE',[status(thm)],[clause_22,32]) ).
cnf(36,plain,
~ equalish(u2r3(exist),u2r2(exist)),
inference('UR-RESOLVE',[status(thm)],[clause_21,32]) ).
cnf(37,plain,
~ equalish(u2r3(exist),u2r1(exist)),
inference('UR-RESOLVE',[status(thm)],[clause_20,32]) ).
cnf(38,plain,
~ equalish(u2r2(exist),u2r1(exist)),
inference('UR-RESOLVE',[status(thm)],[clause_19,32]) ).
cnf(39,plain,
a(u2r3(exist)),
inference('HYPERRESOLVE',[status(thm)],[clause_8,33,clause_1]) ).
cnf(40,plain,
a(u2r2(exist)),
inference('HYPERRESOLVE',[status(thm)],[clause_8,34,clause_1]) ).
cnf(41,plain,
a(u2r1(exist)),
inference('HYPERRESOLVE',[status(thm)],[clause_8,35,clause_1]) ).
cnf(42,plain,
( c(u2r3(exist))
| d(u2r3(exist)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_3,39]) ).
cnf(43,plain,
( c(u2r2(exist))
| d(u2r2(exist)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_3,40]) ).
cnf(44,plain,
( c(u2r1(exist))
| d(u2r1(exist)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_3,41]) ).
cnf(48,plain,
( c(u2r2(exist))
| c(u2r3(exist)) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause_31,43,33,34,42]),36,clause_2]) ).
cnf(52,plain,
( c(u2r1(exist))
| c(u2r3(exist)) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause_31,44,33,35,42]),37,clause_2]) ).
cnf(53,plain,
( c(u2r1(exist))
| c(u2r2(exist)) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause_31,44,34,35,43]),38,clause_2]) ).
cnf(58,plain,
c(u2r1(exist)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause_6,53,clause_1,33,34,52]),36]) ).
cnf(59,plain,
~ c(u2r3(exist)),
inference('UR-RESOLVE',[status(thm)],[clause_6,58,37,clause_1,33,35]) ).
cnf(62,plain,
c(u2r2(exist)),
inference('REWRITE',[status(thm)],[48,59]) ).
cnf(63,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[clause_6,58,38,clause_1,34,35]),62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KRS010-1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n025.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 : Tue Jun 7 07:22:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-07T07:22:34
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n025.cluster.edu at 2022-06-07T07:22:34
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 #||
% 0.20/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.51 % SZS output start Refutation
% See solution above
% 0.20/0.52 ||#
% 0.20/0.52
% 0.20/0.52 ; Summary of computation:
% 0.20/0.52 ; 141 formulas have been input or derived (from 49 formulas).
% 0.20/0.52 ; 63 (45%) were retained. Of these,
% 0.20/0.52 ; 16 (25%) were simplified or subsumed later,
% 0.20/0.52 ; 47 (75%) are still being kept.
% 0.20/0.52 ;
% 0.20/0.52 ; Run time in seconds excluding printing time:
% 0.20/0.52 ; 0.005 11% Read assertion file (1 call)
% 0.20/0.52 ; 0.002 4% Assert (31 calls)
% 0.20/0.52 ; 0.002 4% Process new row (118 calls)
% 0.20/0.52 ; 0.004 9% Resolution (96 calls)
% 0.20/0.52 ; 0.000 0% Paramodulation (48 calls)
% 0.20/0.52 ; 0.000 0% Factoring (6 calls)
% 0.20/0.52 ; 0.000 0% Condensing (46 calls)
% 0.20/0.52 ; 0.003 7% Forward subsumption (46 calls)
% 0.20/0.52 ; 0.002 4% Backward subsumption (45 calls)
% 0.20/0.52 ; 0.000 0% Clause clause subsumption (4 calls)
% 0.20/0.52 ; 0.003 7% Forward simplification (115 calls)
% 0.20/0.52 ; 0.000 0% Backward simplification (63 calls)
% 0.20/0.52 ; 0.000 0% Ordering (56 calls)
% 0.20/0.52 ; 0.001 2% Sortal reasoning (32 calls)
% 0.20/0.52 ; 0.000 0% Purity testing (1 call)
% 0.20/0.52 ; 0.023 51% Other
% 0.20/0.52 ; 0.045 Total
% 0.20/0.52 ; 0.049 Real time
% 0.20/0.52 ;
% 0.20/0.52 ; Term-hash-array has 74 terms in all.
% 0.20/0.52 ; Feature-vector-row-index has 29 entries (42 at peak, 45 added, 16 deleted).
% 0.20/0.52 ; Feature-vector-row-index has 71 nodes (113 at peak, 137 added, 66 deleted).
% 0.20/0.52 ; Retrieved 5 possibly forward subsuming rows in 46 calls.
% 0.20/0.52 ; Retrieved 3 possibly backward subsumed rows in 45 calls.
% 0.20/0.52 ; Path-index has 68 entries (74 at peak, 77 added, 9 deleted).
% 0.20/0.52 ; Path-index has 115 nodes (118 at peak, 119 added, 4 deleted).
% 0.20/0.52 ; Trie-index has 68 entries (74 at peak, 77 added, 9 deleted).
% 0.20/0.52 ; Trie-index has 117 nodes (131 at peak, 137 added, 20 deleted).
% 0.20/0.52 ; Retrieved 92 generalization terms in 194 calls.
% 0.20/0.52 ; Retrieved 17 instance terms in 17 calls.
% 0.20/0.52 ; Retrieved 1,914 unifiable terms in 633 calls.
% 0.20/0.52 ;
% 0.20/0.52 ; The agenda of rows to process has 3 entries:
% 0.20/0.52 ; 1 with value 14 2 with value 19
% 0.20/0.52 ; The agenda of rows to give has 4 entries:
% 0.20/0.52 ; 1 with value (4 9) 1 with value (4 10) 2 with value (4 12)
% 0.20/0.52 Evaluation took:
% 0.20/0.52 0.049 seconds of real time
% 0.20/0.52 0.043845 seconds of user run time
% 0.20/0.52 0.005069 seconds of system run time
% 0.20/0.52 0 calls to %EVAL
% 0.20/0.52 0 page faults and
% 0.20/0.52 4,159,800 bytes consed.
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-07T07:22:34
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 *
%------------------------------------------------------------------------------