TSTP Solution File: LAT382+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LAT382+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n029.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 06:44:59 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of clauses : 19 ( 14 unt; 0 nHn; 19 RR)
% Number of literals : 35 ( 2 equ; 17 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ aSet0(X)
| ~ aElementOf0(Y,X)
| aElement0(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
cnf(9,axiom,
( ~ aElement0(X)
| ~ aElement0(Y)
| ~ sdtlseqdt0(X,Y)
| ~ sdtlseqdt0(Y,X)
| X = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mASymm) ).
cnf(19,axiom,
( ~ aSet0(X)
| ~ aSubsetOf0(Y,X)
| ~ aInfimumOfIn0(Z,Y,X)
| aElementOf0(Z,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefInf) ).
cnf(20,axiom,
( ~ aSet0(X)
| ~ aSubsetOf0(Y,X)
| ~ aInfimumOfIn0(Z,Y,X)
| aLowerBoundOfIn0(Z,Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefInf) ).
cnf(21,axiom,
( ~ aSet0(X)
| ~ aSubsetOf0(Y,X)
| ~ aInfimumOfIn0(Z,Y,X)
| ~ aLowerBoundOfIn0(U,Y,X)
| sdtlseqdt0(U,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefInf) ).
cnf(30,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773) ).
cnf(31,hypothesis,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773_01) ).
cnf(32,hypothesis,
aInfimumOfIn0(xu,xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__792) ).
cnf(33,hypothesis,
aInfimumOfIn0(xv,xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__792) ).
cnf(34,negated_conjecture,
xu != xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
cnf(37,plain,
aElementOf0(xu,xT),
inference('HYPERRESOLVE',[status(thm)],[19,30,31,32]) ).
cnf(38,plain,
aElementOf0(xv,xT),
inference('HYPERRESOLVE',[status(thm)],[19,30,31,33]) ).
cnf(40,plain,
aLowerBoundOfIn0(xu,xS,xT),
inference('HYPERRESOLVE',[status(thm)],[20,30,31,32]) ).
cnf(41,plain,
aLowerBoundOfIn0(xv,xS,xT),
inference('HYPERRESOLVE',[status(thm)],[20,30,31,33]) ).
cnf(45,plain,
aElement0(xu),
inference('HYPERRESOLVE',[status(thm)],[1,37,30]) ).
cnf(49,plain,
aElement0(xv),
inference('HYPERRESOLVE',[status(thm)],[1,38,30]) ).
cnf(53,plain,
sdtlseqdt0(xu,xv),
inference('HYPERRESOLVE',[status(thm)],[21,40,30,31,33]) ).
cnf(54,plain,
sdtlseqdt0(xv,xu),
inference('HYPERRESOLVE',[status(thm)],[21,41,30,31,32]) ).
cnf(55,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[9,53,45,49,34]),54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT382+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 28 19:21:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-06-28T19:21:07
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-06-28T19:21:07
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 #||
% 0.20/0.51 % SZS status Theorem for /export/starexec/sandbox/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 ; 83 formulas have been input or derived (from 44 formulas).
% 0.20/0.52 ; 55 (66%) were retained. Of these,
% 0.20/0.52 ; 1 ( 2%) were simplified or subsumed later,
% 0.20/0.52 ; 54 (98%) 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 12% Read assertion file (1 call)
% 0.20/0.52 ; 0.001 2% Assert (18 calls)
% 0.20/0.52 ; 0.004 9% Process new row (79 calls)
% 0.20/0.52 ; 0.007 16% Resolution (86 calls)
% 0.20/0.52 ; 0.000 0% Paramodulation (43 calls)
% 0.20/0.52 ; 0.000 0% Condensing (37 calls)
% 0.20/0.52 ; 0.001 2% Forward subsumption (37 calls)
% 0.20/0.52 ; 0.000 0% Backward subsumption (36 calls)
% 0.20/0.52 ; 0.000 0% Clause clause subsumption (4 calls)
% 0.20/0.52 ; 0.000 0% Forward simplification (79 calls)
% 0.20/0.52 ; 0.000 0% Backward simplification (55 calls)
% 0.20/0.52 ; 0.000 0% Ordering (11 calls)
% 0.20/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.52 ; 0.001 2% Purity testing (1 call)
% 0.20/0.52 ; 0.024 56% Other
% 0.20/0.52 ; 0.043 Total
% 0.20/0.52 ; 0.045 Real time
% 0.20/0.52 ;
% 0.20/0.52 ; Term-hash-array has 81 terms in all.
% 0.20/0.52 ; Feature-vector-row-index has 35 entries (35 at peak, 36 added, 1 deleted).
% 0.20/0.52 ; Feature-vector-row-index has 110 nodes (110 at peak, 114 added, 4 deleted).
% 0.20/0.52 ; Retrieved 4 possibly forward subsuming rows in 37 calls.
% 0.20/0.52 ; Retrieved 0 possibly backward subsumed rows in 36 calls.
% 0.20/0.52 ; Path-index has 85 entries (85 at peak, 87 added, 2 deleted).
% 0.20/0.52 ; Path-index has 192 nodes (192 at peak, 194 added, 2 deleted).
% 0.20/0.52 ; Trie-index has 85 entries (85 at peak, 87 added, 2 deleted).
% 0.20/0.52 ; Trie-index has 170 nodes (170 at peak, 173 added, 3 deleted).
% 0.20/0.52 ; Retrieved 24 generalization terms in 49 calls.
% 0.20/0.52 ; Retrieved 18 instance terms in 18 calls.
% 0.20/0.52 ; Retrieved 2,747 unifiable terms in 1,010 calls.
% 0.20/0.52 ;
% 0.20/0.52 ; The agenda of rows to give has 10 entries:
% 0.20/0.52 ; 1 with value (4 6) 1 with value (4 11) 2 with value (4 13)
% 0.20/0.52 ; 3 with value (4 7) 1 with value (4 12) 2 with value (4 14)
% 0.20/0.52 Evaluation took:
% 0.20/0.52 0.045 seconds of real time
% 0.20/0.52 0.041518 seconds of user run time
% 0.20/0.52 0.00382 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 3,074,872 bytes consed.
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-28T19:21:07
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 *
%------------------------------------------------------------------------------