%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KRS013-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n020.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:22 EDT 2022
% Result : Unsatisfiable 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 29 ( 15 unt; 4 nHn; 26 RR)
% Number of literals : 50 ( 0 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_2,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_3,axiom,
( t2least(X)
| ~ c(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_5,axiom,
( ~ t2least(X)
| ~ equalish(u1r2(X),u1r1(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_6,axiom,
( t(X,u1r1(X))
| ~ t2least(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_7,axiom,
( t(X,u1r2(X))
| ~ t2least(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_9,axiom,
( t1most(X)
| ~ d(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_11,axiom,
( equalish(X,Y)
| ~ t1most(Z)
| ~ t(Z,X)
| ~ t(Z,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_15,axiom,
( d(X)
| ~ e(Y)
| ~ r(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_16,axiom,
( c(X)
| ~ e(Y)
| ~ r(Y,X)
| ~ s2least(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_26,axiom,
( s2least(X)
| equalish(Y,Z)
| ~ s(X,Y)
| ~ s(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_26) ).
cnf(clause_28,axiom,
( f(X)
| ~ s1most(u6r1(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_28) ).
cnf(clause_29,axiom,
( f(X)
| r(X,u6r1(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_29) ).
cnf(clause_31,axiom,
( s1most(X)
| ~ equalish(u7r2(X),u7r1(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_31) ).
cnf(clause_32,axiom,
( s1most(X)
| s(X,u7r1(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_32) ).
cnf(clause_33,axiom,
( s1most(X)
| s(X,u7r2(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_33) ).
cnf(34,plain,
~ s1most(u6r1(exist)),
inference('UR-RESOLVE',[status(thm)],[clause_28,clause_2]) ).
cnf(35,plain,
r(exist,u6r1(exist)),
inference('UR-RESOLVE',[status(thm)],[clause_29,clause_2]) ).
cnf(36,plain,
d(u6r1(exist)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause_15,clause_1,clause_29]),clause_2]) ).
cnf(45,plain,
s(u6r1(exist),u7r2(u6r1(exist))),
inference('UR-RESOLVE',[status(thm)],[clause_33,34]) ).
cnf(47,plain,
~ equalish(u7r2(u6r1(exist)),u7r1(u6r1(exist))),
inference('UR-RESOLVE',[status(thm)],[clause_31,34]) ).
cnf(48,plain,
t1most(u6r1(exist)),
inference('HYPERRESOLVE',[status(thm)],[clause_9,36]) ).
cnf(50,plain,
s2least(u6r1(exist)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause_26,45,clause_32]),47,34]) ).
cnf(51,plain,
c(u6r1(exist)),
inference('HYPERRESOLVE',[status(thm)],[clause_16,50,clause_1,35]) ).
cnf(55,plain,
t2least(u6r1(exist)),
inference('HYPERRESOLVE',[status(thm)],[clause_3,51]) ).
cnf(56,plain,
t(u6r1(exist),u1r2(u6r1(exist))),
inference('HYPERRESOLVE',[status(thm)],[clause_7,55]) ).
cnf(57,plain,
t(u6r1(exist),u1r1(u6r1(exist))),
inference('HYPERRESOLVE',[status(thm)],[clause_6,55]) ).
cnf(58,plain,
~ equalish(u1r2(u6r1(exist)),u1r1(u6r1(exist))),
inference('UR-RESOLVE',[status(thm)],[clause_5,55]) ).
cnf(72,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause_11,57,48,56]),58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS013-1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 7 17:18:06 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-07T17:18:07
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-06-07T17:18:07
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 #||
% 0.20/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.53 % SZS output start Refutation
% See solution above
% 0.20/0.53 ||#
% 0.20/0.53
% 0.20/0.53 ; Summary of computation:
% 0.20/0.53 ; 285 formulas have been input or derived (from 63 formulas).
% 0.20/0.53 ; 72 (25%) were retained. Of these,
% 0.20/0.53 ; 9 (12%) were simplified or subsumed later,
% 0.20/0.53 ; 63 (88%) are still being kept.
% 0.20/0.53 ;
% 0.20/0.53 ; Run time in seconds excluding printing time:
% 0.20/0.53 ; 0.005 10% Read assertion file (1 call)
% 0.20/0.53 ; 0.001 2% Assert (33 calls)
% 0.20/0.53 ; 0.004 8% Process new row (237 calls)
% 0.20/0.53 ; 0.007 15% Resolution (124 calls)
% 0.20/0.53 ; 0.000 0% Paramodulation (62 calls)
% 0.20/0.53 ; 0.001 2% Factoring (21 calls)
% 0.20/0.53 ; 0.000 0% Condensing (97 calls)
% 0.20/0.53 ; 0.001 2% Forward subsumption (97 calls)
% 0.20/0.53 ; 0.001 2% Backward subsumption (50 calls)
% 0.20/0.53 ; 0.000 0% Clause clause subsumption (59 calls)
% 0.20/0.53 ; 0.005 10% Forward simplification (235 calls)
% 0.20/0.53 ; 0.000 0% Backward simplification (72 calls)
% 0.20/0.53 ; 0.000 0% Ordering (83 calls)
% 0.20/0.53 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.53 ; 0.000 0% Purity testing (1 call)
% 0.20/0.53 ; 0.023 48% Other
% 0.20/0.53 ; 0.048 Total
% 0.20/0.53 ; 0.052 Real time
% 0.20/0.53 ;
% 0.20/0.53 ; Term-hash-array has 89 terms in all.
% 0.20/0.53 ; Feature-vector-row-index has 41 entries (42 at peak, 50 added, 9 deleted).
% 0.20/0.53 ; Feature-vector-row-index has 86 nodes (103 at peak, 112 added, 26 deleted).
% 0.20/0.53 ; Retrieved 67 possibly forward subsuming rows in 97 calls.
% 0.20/0.53 ; Retrieved 22 possibly backward subsumed rows in 50 calls.
% 0.20/0.53 ; Path-index has 83 entries (85 at peak, 90 added, 7 deleted).
% 0.20/0.53 ; Path-index has 175 nodes (175 at peak, 180 added, 5 deleted).
% 0.20/0.53 ; Trie-index has 83 entries (85 at peak, 90 added, 7 deleted).
% 0.20/0.53 ; Trie-index has 178 nodes (180 at peak, 197 added, 19 deleted).
% 0.20/0.53 ; Retrieved 189 generalization terms in 461 calls.
% 0.20/0.53 ; Retrieved 21 instance terms in 21 calls.
% 0.20/0.53 ; Retrieved 932 unifiable terms in 470 calls.
% 0.20/0.53 ;
% 0.20/0.53 ; The agenda of rows to process has 37 entries:
% 0.20/0.53 ; 5 with value 17 16 with value 22 16 with value 27
% 0.20/0.53 ; The agenda of rows to give has 6 entries:
% 0.20/0.53 ; 1 with value (4 16) 1 with value (4 18) 1 with value (4 19)
% 0.20/0.53 ; 3 with value (4 17)
% 0.20/0.53 Evaluation took:
% 0.20/0.53 0.053 seconds of real time
% 0.20/0.53 0.044473 seconds of user run time
% 0.20/0.53 0.0079 seconds of system run time
% 0.20/0.53 0 calls to %EVAL
% 0.20/0.53 0 page faults and
% 0.20/0.53 3,996,016 bytes consed.
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-07T17:18:07
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 *
%------------------------------------------------------------------------------