TSTP Solution File: ALG205+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : ALG205+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n018.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 : Thu Jul 14 18:00:10 EDT 2022
% Result : Theorem 0.50s 0.68s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of clauses : 25 ( 19 unt; 6 nHn; 25 RR)
% Number of literals : 46 ( 45 equ; 7 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
e10 != e13,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
cnf(6,axiom,
e10 != e16,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
cnf(10,axiom,
e11 != e15,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
cnf(11,axiom,
e11 != e16,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
cnf(13,axiom,
e12 != e14,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
cnf(14,axiom,
e12 != e15,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
cnf(16,axiom,
e13 != e14,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
cnf(92,axiom,
op1(e10,e10) = e13,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
cnf(100,axiom,
op1(e11,e11) = e16,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
cnf(108,axiom,
op1(e12,e12) = e15,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
cnf(116,axiom,
op1(e13,e13) = e14,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
cnf(124,axiom,
op1(e14,e14) = e12,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
cnf(132,axiom,
op1(e15,e15) = e11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
cnf(140,axiom,
op1(e16,e16) = e10,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
cnf(173,axiom,
op2(e24,e24) = e24,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
cnf(201,negated_conjecture,
( j(e24) = e10
| j(e24) = e11
| j(e24) = e12
| j(e24) = e13
| j(e24) = e14
| j(e24) = e15
| j(e24) = e16 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(366,negated_conjecture,
j(op2(e24,e24)) = op1(j(e24),j(e24)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(367,plain,
j(e24) = op1(j(e24),j(e24)),
inference('REWRITE',[status(thm)],[366,173,theory(equality)]) ).
cnf(569,plain,
( j(e24) = e10
| j(e24) = e11
| j(e24) = e12
| j(e24) = e13
| j(e24) = e14
| j(e24) = e15 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[367,201,theory(equality)]),6,140,theory(equality)]) ).
cnf(599,plain,
( j(e24) = e10
| j(e24) = e11
| j(e24) = e12
| j(e24) = e13
| j(e24) = e14 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[367,569,theory(equality)]),10,132,theory(equality)]) ).
cnf(601,plain,
( j(e24) = e10
| j(e24) = e11
| j(e24) = e12
| j(e24) = e13 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[367,599,theory(equality)]),13,124,theory(equality)]) ).
cnf(603,plain,
( j(e24) = e10
| j(e24) = e11
| j(e24) = e12 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[367,601,theory(equality)]),16,116,theory(equality)]) ).
cnf(605,plain,
( j(e24) = e10
| j(e24) = e11 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[367,603,theory(equality)]),14,108,theory(equality)]) ).
cnf(607,plain,
j(e24) = e10,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[367,605,theory(equality)]),11,100,theory(equality)]) ).
cnf(620,plain,
$false,
inference('REWRITE',[status(thm)],[367,3,92,607,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : ALG205+1 : TPTP v8.1.0. Released v2.7.0.
% 0.04/0.13 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 8 19:21:52 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 *
% 0.21/0.48 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.49 SNARK-TPTP-OPTIONS
% 0.21/0.49 *
% 0.21/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.49 (USE-FACTORING :POS)
% 0.21/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.49 *
% 0.21/0.49 "."
% 0.21/0.49 *
% 0.21/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-08T19:21:52
% 0.21/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-08T19:21:52
% 0.50/0.68
% 0.50/0.68
% 0.50/0.68 #||
% 0.50/0.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.50/0.68 % SZS output start Refutation
% See solution above
% 0.50/0.69 ||#
% 0.50/0.69
% 0.50/0.69 ; Summary of computation:
% 0.50/0.69 ; 954 formulas have been input or derived (from 321 formulas).
% 0.50/0.69 ; 620 (65%) were retained. Of these,
% 0.50/0.69 ; 154 (25%) were simplified or subsumed later,
% 0.50/0.69 ; 466 (75%) are still being kept.
% 0.50/0.69 ;
% 0.50/0.69 ; Run time in seconds excluding printing time:
% 0.50/0.69 ; 0.025 13% Read assertion file (1 call)
% 0.50/0.69 ; 0.030 15% Assert (6 calls)
% 0.50/0.69 ; 0.046 24% Process new row (810 calls)
% 0.50/0.69 ; 0.003 2% Resolution (640 calls)
% 0.50/0.69 ; 0.013 7% Paramodulation (320 calls)
% 0.50/0.69 ; 0.000 0% Factoring (19 calls)
% 0.50/0.69 ; 0.000 0% Condensing (207 calls)
% 0.50/0.69 ; 0.018 9% Forward subsumption (207 calls)
% 0.50/0.69 ; 0.006 3% Backward subsumption (207 calls)
% 0.50/0.69 ; 0.001 1% Clause clause subsumption (166 calls)
% 0.50/0.69 ; 0.020 10% Forward simplification (745 calls)
% 0.50/0.69 ; 0.002 1% Backward simplification (522 calls)
% 0.50/0.69 ; 0.003 2% Ordering (2,758 calls)
% 0.50/0.69 ; 0.001 1% Sortal reasoning (32 calls)
% 0.50/0.69 ; 0.001 1% Purity testing (1 call)
% 0.50/0.69 ; 0.025 13% Other
% 0.50/0.69 ; 0.194 Total
% 0.50/0.69 ; 0.205 Real time
% 0.50/0.69 ;
% 0.50/0.69 ; Term-hash-array has 827 terms in all.
% 0.50/0.69 ; Feature-vector-row-index has 171 entries (197 at peak, 207 added, 36 deleted).
% 0.50/0.69 ; Feature-vector-row-index has 1,242 nodes (1,431 at peak, 1,504 added, 262 deleted).
% 0.50/0.69 ; Retrieved 86 possibly forward subsuming rows in 207 calls.
% 0.50/0.69 ; Retrieved 89 possibly backward subsumed rows in 207 calls.
% 0.50/0.69 ; Path-index has 773 entries (820 at peak, 865 added, 92 deleted).
% 0.50/0.69 ; Path-index has 220 nodes (226 at peak, 226 added, 6 deleted).
% 0.50/0.69 ; Trie-index has 773 entries (820 at peak, 865 added, 92 deleted).
% 0.50/0.69 ; Trie-index has 1,238 nodes (1,307 at peak, 1,375 added, 137 deleted).
% 0.50/0.69 ; Retrieved 203 generalization terms in 3,016 calls.
% 0.50/0.69 ; Retrieved 314 instance terms in 314 calls.
% 0.50/0.69 ; Retrieved 229 unifiable terms in 1,964 calls.
% 0.50/0.69 ;
% 0.50/0.69 ; The agenda of backward simplifiable rows to process has 33 entries:
% 0.50/0.69 ; 33 with value 0
% 0.50/0.69 ; The agenda of rows to process has 13 entries:
% 0.50/0.69 ; 1 with value 20 12 with value 22
% 0.50/0.69 ; The agenda of input rows to give has 12 entries:
% 0.50/0.69 ; 12 with value 10
% 0.50/0.69 ; The agenda of rows to give has 159 entries:
% 0.50/0.69 ; 1 with value (4 12) 26 with value (4 46) 106 with value (4 47)
% 0.50/0.69 ; 26 with value (4 43)
% 0.50/0.69 Evaluation took:
% 0.50/0.69 0.205 seconds of real time
% 0.50/0.69 0.182055 seconds of user run time
% 0.50/0.69 0.023843 seconds of system run time
% 0.50/0.69 [Run times include 0.009 seconds GC run time.]
% 0.50/0.69 0 calls to %EVAL
% 0.50/0.69 0 page faults and
% 0.50/0.69 12,619,864 bytes consed.
% 0.50/0.69 :PROOF-FOUND
% 0.50/0.69 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-08T19:21:52
% 0.50/0.69 :PROOF-FOUND
% 0.50/0.69 *
%------------------------------------------------------------------------------