TSTP Solution File: LCL656+1.001 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL656+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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 14:24:30 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of clauses : 9 ( 6 unt; 1 nHn; 8 RR)
% Number of literals : 16 ( 0 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
r1(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
cnf(2,negated_conjecture,
( ~ r1('SKOLEMAAAV1',X)
| p2(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
cnf(3,negated_conjecture,
( ~ r1('SKOLEMAAAV1',X)
| r1(X,'SKOLEMAAAV2'(X))
| p101(X)
| ~ p100(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
cnf(4,negated_conjecture,
( ~ r1('SKOLEMAAAV1',X)
| ~ p2('SKOLEMAAAV2'(X))
| p101(X)
| ~ p100(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
cnf(13,negated_conjecture,
~ p101('SKOLEMAAAV1'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
cnf(14,negated_conjecture,
p100('SKOLEMAAAV1'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
cnf(16,plain,
~ p2('SKOLEMAAAV2'('SKOLEMAAAV1')),
inference('UR-RESOLVE',[status(thm)],[4,1,13,14]) ).
cnf(20,plain,
r1('SKOLEMAAAV1','SKOLEMAAAV2'('SKOLEMAAAV1')),
inference('UR-RESOLVE',[status(thm)],[3,1,13,14]) ).
cnf(22,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[2,16]),20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL656+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n021.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 : Sun Jul 3 07:19:45 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 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.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T07:19:45
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-07-03T07:19:45
% 0.20/0.50 WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.50 WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.50 WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.50 WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.50 WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.50 WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.50 WARNING:
% 0.20/0.50 |p102| is a 1-ary relation that occurs only negatively; disabling rows that contain it.
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 #||
% 0.20/0.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 % 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 ; 32 formulas have been input or derived (from 17 formulas).
% 0.20/0.52 ; 22 (69%) were retained. Of these,
% 0.20/0.52 ; 22 (100%) are still being kept.
% 0.20/0.52 ;
% 0.20/0.52 ; Run time in seconds excluding printing time:
% 0.20/0.52 ; 0.002 7% Read assertion file (1 call)
% 0.20/0.52 ; 0.002 7% Assert (2 calls)
% 0.20/0.52 ; 0.001 3% Process new row (31 calls)
% 0.20/0.52 ; 0.001 3% Resolution (32 calls)
% 0.20/0.52 ; 0.000 0% Paramodulation (16 calls)
% 0.20/0.52 ; 0.001 3% Condensing (12 calls)
% 0.20/0.52 ; 0.000 0% Forward subsumption (12 calls)
% 0.20/0.52 ; 0.000 0% Backward subsumption (11 calls)
% 0.20/0.52 ; 0.000 0% Clause clause subsumption (5 calls)
% 0.20/0.52 ; 0.000 0% Forward simplification (28 calls)
% 0.20/0.52 ; 0.000 0% Backward simplification (22 calls)
% 0.20/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.52 ; 0.000 0% Purity testing (1 call)
% 0.20/0.52 ; 0.023 77% Other
% 0.20/0.52 ; 0.030 Total
% 0.20/0.52 ; 0.032 Real time
% 0.20/0.52 ;
% 0.20/0.52 ; Term-hash-array has 30 terms in all.
% 0.20/0.52 ; Feature-vector-row-index has 11 entries (11 at peak, 11 added, 0 deleted).
% 0.20/0.52 ; Feature-vector-row-index has 39 nodes (39 at peak, 39 added, 0 deleted).
% 0.20/0.52 ; Retrieved 4 possibly forward subsuming rows in 12 calls.
% 0.20/0.52 ; Retrieved 1 possibly backward subsumed row in 11 calls.
% 0.20/0.52 ; Path-index has 31 entries (31 at peak, 31 added, 0 deleted).
% 0.20/0.52 ; Path-index has 43 nodes (43 at peak, 43 added, 0 deleted).
% 0.20/0.52 ; Trie-index has 31 entries (31 at peak, 31 added, 0 deleted).
% 0.20/0.52 ; Trie-index has 44 nodes (44 at peak, 44 added, 0 deleted).
% 0.20/0.52 ; Retrieved 31 generalization terms in 35 calls.
% 0.20/0.52 ; Retrieved 10 instance terms in 10 calls.
% 0.20/0.52 ; Retrieved 307 unifiable terms in 137 calls.
% 0.20/0.52 ;
% 0.20/0.52 ; The agenda of rows to give has 5 entries:
% 0.20/0.52 ; 3 with value (4 6) 2 with value (4 7)
% 0.20/0.52 Evaluation took:
% 0.20/0.52 0.032 seconds of real time
% 0.20/0.52 0.028885 seconds of user run time
% 0.20/0.52 0.002978 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 1,931,904 bytes consed.
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T07:19:45
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 *
%------------------------------------------------------------------------------