TSTP Solution File: KRS003_1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KRS003_1 : TPTP v8.1.0. Released v5.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:20 EDT 2022
% Result : Theorem 0.22s 0.55s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of formulae : 18 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 22 ( 12 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 20 ( 20 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 14 ( 13 usr; 4 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 10 ( 0 sgn 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
tff(1,axiom,
! [X: unreal] :
( ~ c(X)
| s2least(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
tff(3,axiom,
! [X: unreal] :
( ~ s2least(X)
| ~ equalish(u1r2(X),u1r1(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
tff(4,axiom,
! [X: unreal] :
( ~ s2least(X)
| s(X,u1r1(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
tff(5,axiom,
! [X: unreal] :
( ~ s2least(X)
| s(X,u1r2(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
tff(7,axiom,
! [X: unreal] :
( ~ d(X)
| s1most(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
tff(9,axiom,
! [X: unreal,Y: real,Z: real] :
( ~ s1most(X)
| ~ s(X,Y)
| ~ s(X,Z)
| equalish(Y,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
tff(13,axiom,
! [X: unreal] :
( ~ e(X)
| c(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
tff(14,axiom,
! [X: unreal] :
( ~ f(X)
| d(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).
tff(15,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1__clause_2) ).
tff(16,negated_conjecture,
f(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1__clause_2) ).
tff(17,plain,
c(exist),
inference('HYPERRESOLVE',[status(thm)],[13,15]) ).
tff(18,plain,
d(exist),
inference('HYPERRESOLVE',[status(thm)],[14,16]) ).
tff(23,plain,
s2least(exist),
inference('HYPERRESOLVE',[status(thm)],[1,17]) ).
tff(24,plain,
s1most(exist),
inference('HYPERRESOLVE',[status(thm)],[7,18]) ).
tff(25,plain,
s(exist,u1r2(exist)),
inference('HYPERRESOLVE',[status(thm)],[5,23]) ).
tff(26,plain,
s(exist,u1r1(exist)),
inference('HYPERRESOLVE',[status(thm)],[4,23]) ).
tff(27,plain,
~ equalish(u1r2(exist),u1r1(exist)),
inference('UR-RESOLVE',[status(thm)],[3,23]) ).
cnf(31,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[9,26,24,25]),27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KRS003_1 : TPTP v8.1.0. Released v5.0.0.
% 0.08/0.15 % Command : run-snark %s %d
% 0.15/0.37 % Computer : n020.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Tue Jun 7 16:51:06 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.22/0.50 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.51 *
% 0.22/0.51 *
% 0.22/0.52 #<PACKAGE "SNARK-USER">
% 0.22/0.52 *
% 0.22/0.52 SNARK-TPTP-OPTIONS
% 0.22/0.52 *
% 0.22/0.52 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.52 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.52 (USE-FACTORING :POS)
% 0.22/0.52 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.52 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.52 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.52 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.52 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.52 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.52 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.52 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.52 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.52 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.52 *
% 0.22/0.52 "."
% 0.22/0.52 *
% 0.22/0.52 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-07T16:51:07
% 0.22/0.52 ; 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-07T16:51:07
% 0.22/0.55
% 0.22/0.55
% 0.22/0.55 #||
% 0.22/0.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.55 % SZS output start Refutation
% See solution above
% 0.22/0.56 ||#
% 0.22/0.56
% 0.22/0.56 ; Summary of computation:
% 0.22/0.56 ; 75 formulas have been input or derived (from 23 formulas).
% 0.22/0.56 ; 31 (41%) were retained. Of these,
% 0.22/0.56 ; 31 (100%) are still being kept.
% 0.22/0.56 ;
% 0.22/0.56 ; Run time in seconds excluding printing time:
% 0.22/0.56 ; 0.005 15% Read assertion file (1 call)
% 0.22/0.56 ; 0.001 3% Assert (15 calls)
% 0.22/0.56 ; 0.002 6% Process new row (49 calls)
% 0.22/0.56 ; 0.002 6% Resolution (44 calls)
% 0.22/0.56 ; 0.000 0% Paramodulation (22 calls)
% 0.22/0.56 ; 0.000 0% Factoring (2 calls)
% 0.22/0.56 ; 0.001 3% Condensing (18 calls)
% 0.22/0.56 ; 0.000 0% Forward subsumption (18 calls)
% 0.22/0.56 ; 0.000 0% Backward subsumption (18 calls)
% 0.22/0.56 ; 0.000 0% Clause clause subsumption (2 calls)
% 0.22/0.56 ; 0.001 3% Forward simplification (49 calls)
% 0.22/0.56 ; 0.000 0% Backward simplification (31 calls)
% 0.22/0.56 ; 0.000 0% Ordering (20 calls)
% 0.22/0.56 ; 0.000 0% Sortal reasoning (34 calls)
% 0.22/0.56 ; 0.000 0% Purity testing (1 call)
% 0.22/0.56 ; 0.022 65% Other
% 0.22/0.56 ; 0.034 Total
% 0.22/0.56 ; 0.036 Real time
% 0.22/0.56 ;
% 0.22/0.56 ; Term-hash-array has 36 terms in all.
% 0.22/0.56 ; Feature-vector-row-index has 18 entries (18 at peak, 18 added, 0 deleted).
% 0.22/0.56 ; Feature-vector-row-index has 41 nodes (41 at peak, 41 added, 0 deleted).
% 0.22/0.56 ; Retrieved 1 possibly forward subsuming row in 18 calls.
% 0.22/0.56 ; Retrieved 1 possibly backward subsumed row in 18 calls.
% 0.22/0.56 ; Path-index has 37 entries (37 at peak, 37 added, 0 deleted).
% 0.22/0.56 ; Path-index has 69 nodes (69 at peak, 69 added, 0 deleted).
% 0.22/0.56 ; Trie-index has 37 entries (37 at peak, 37 added, 0 deleted).
% 0.22/0.56 ; Trie-index has 76 nodes (76 at peak, 76 added, 0 deleted).
% 0.22/0.56 ; Retrieved 25 generalization terms in 41 calls.
% 0.22/0.56 ; Retrieved 12 instance terms in 12 calls.
% 0.22/0.56 ; Retrieved 300 unifiable terms in 161 calls.
% 0.22/0.56 ;
% 0.22/0.56 ; The agenda of rows to process has 17 entries:
% 0.22/0.56 ; 5 with value 11 8 with value 14 4 with value 17
% 0.22/0.56 ; The agenda of rows to give has 8 entries:
% 0.22/0.56 ; 1 with value (4 10) 3 with value (4 11) 4 with value (4 14)
% 0.22/0.56 Evaluation took:
% 0.22/0.56 0.037 seconds of real time
% 0.22/0.56 0.031013 seconds of user run time
% 0.22/0.56 0.005731 seconds of system run time
% 0.22/0.56 0 calls to %EVAL
% 0.22/0.56 0 page faults and
% 0.22/0.56 2,538,248 bytes consed.
% 0.22/0.56 :PROOF-FOUND
% 0.22/0.56 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-07T16:51:07
% 0.22/0.56 :PROOF-FOUND
% 0.22/0.56 *
%------------------------------------------------------------------------------