TSTP Solution File: ALG175+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : ALG175+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n023.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:05 EDT 2022
% Result : Theorem 0.46s 0.63s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 19
% Syntax : Number of clauses : 38 ( 34 unt; 4 nHn; 38 RR)
% Number of literals : 48 ( 47 equ; 9 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(19,axiom,
( op(e3,e3) = e0
| op(e3,e3) = e1
| op(e3,e3) = e2
| op(e3,e3) = e3
| op(e3,e3) = e4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
cnf(85,axiom,
op(op(e4,e1),op(e1,e4)) = e1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
cnf(133,axiom,
op(e0,e3) != op(e3,e3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
cnf(136,axiom,
op(e1,e3) != op(e3,e3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
cnf(138,axiom,
op(e2,e3) != op(e3,e3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
cnf(140,axiom,
op(e3,e3) != op(e4,e3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
cnf(206,axiom,
e1 != e3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
cnf(211,axiom,
e0 = op(op(e3,e1),e3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
cnf(212,axiom,
e2 = op(e3,op(op(e3,e1),e3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
cnf(213,plain,
op(e3,e0) = e2,
inference('REWRITE',[status(thm)],[212,211,theory(equality)]) ).
cnf(214,axiom,
op(e3,e1) = e4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
cnf(217,negated_conjecture,
op(e0,op(e0,e2)) = e2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
cnf(224,negated_conjecture,
op(e1,op(e1,e4)) = e4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
cnf(230,negated_conjecture,
op(e3,op(e3,e0)) = e0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
cnf(231,plain,
op(e3,e2) = e0,
inference('REWRITE',[status(thm)],[230,213,theory(equality)]) ).
cnf(232,negated_conjecture,
op(e3,op(e3,e1)) = e1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
cnf(233,plain,
op(e3,e4) = e1,
inference('REWRITE',[status(thm)],[232,214,theory(equality)]) ).
cnf(243,negated_conjecture,
op(op(e0,e3),e3) = e0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
cnf(248,negated_conjecture,
op(op(e1,e3),e3) = e1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
cnf(257,negated_conjecture,
op(op(e3,e1),e1) = e3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
cnf(258,plain,
op(e4,e1) = e3,
inference('REWRITE',[status(thm)],[257,214,theory(equality)]) ).
cnf(259,negated_conjecture,
op(op(e3,e2),e2) = e3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
cnf(260,plain,
op(e0,e2) = e3,
inference('REWRITE',[status(thm)],[259,231,theory(equality)]) ).
cnf(262,negated_conjecture,
op(op(e3,e4),e4) = e3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
cnf(263,plain,
op(e1,e4) = e3,
inference('REWRITE',[status(thm)],[262,233,theory(equality)]) ).
cnf(287,plain,
op(e1,e3) = e4,
inference('REWRITE',[status(thm)],[224,263,theory(equality)]) ).
cnf(295,plain,
op(e3,e3) != e4,
inference('REWRITE',[status(thm)],[136,287,theory(equality)]) ).
cnf(296,plain,
( op(e3,e3) = e0
| op(e3,e3) = e1
| op(e3,e3) = e2
| op(e3,e3) = e3 ),
inference('REWRITE',[status(thm)],[19,295]) ).
cnf(305,plain,
op(e4,e3) = e1,
inference('REWRITE',[status(thm)],[248,287,theory(equality)]) ).
cnf(310,plain,
op(e3,e3) != e1,
inference('REWRITE',[status(thm)],[140,305,theory(equality)]) ).
cnf(311,plain,
( op(e3,e3) = e0
| op(e3,e3) = e2
| op(e3,e3) = e3 ),
inference('REWRITE',[status(thm)],[296,310]) ).
cnf(339,plain,
op(e0,e3) = e2,
inference('REWRITE',[status(thm)],[217,260,theory(equality)]) ).
cnf(342,plain,
op(e3,e3) != e2,
inference('REWRITE',[status(thm)],[133,339,theory(equality)]) ).
cnf(343,plain,
( op(e3,e3) = e0
| op(e3,e3) = e3 ),
inference('REWRITE',[status(thm)],[311,342]) ).
cnf(350,plain,
op(e2,e3) = e0,
inference('REWRITE',[status(thm)],[243,339,theory(equality)]) ).
cnf(351,plain,
op(e3,e3) != e0,
inference('REWRITE',[status(thm)],[138,350,theory(equality)]) ).
cnf(352,plain,
op(e3,e3) = e3,
inference('REWRITE',[status(thm)],[343,351]) ).
cnf(363,plain,
$false,
inference('REWRITE',[status(thm)],[85,206,352,263,258,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG175+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n023.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 : Wed Jun 8 21:05:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.48 #<PACKAGE "SNARK-USER">
% 0.19/0.48 *
% 0.19/0.48 SNARK-TPTP-OPTIONS
% 0.19/0.48 *
% 0.19/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-08T21:05:23
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-06-08T21:05:23
% 0.46/0.63
% 0.46/0.63
% 0.46/0.63 #||
% 0.46/0.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.63 % SZS output start Refutation
% See solution above
% 0.46/0.63 ||#
% 0.46/0.63
% 0.46/0.63 ; Summary of computation:
% 0.46/0.63 ; 499 formulas have been input or derived (from 1 formulas).
% 0.46/0.63 ; 363 (73%) were retained. Of these,
% 0.46/0.63 ; 236 (65%) were simplified or subsumed later,
% 0.46/0.63 ; 127 (35%) are still being kept.
% 0.46/0.63 ;
% 0.46/0.63 ; Run time in seconds excluding printing time:
% 0.46/0.63 ; 0.037 25% Read assertion file (1 call)
% 0.46/0.63 ; 0.044 29% Assert (7 calls)
% 0.46/0.63 ; 0.027 18% Process new row (400 calls)
% 0.46/0.63 ; 0.000 0% Condensing (131 calls)
% 0.46/0.63 ; 0.005 3% Forward subsumption (131 calls)
% 0.46/0.63 ; 0.005 3% Backward subsumption (131 calls)
% 0.46/0.63 ; 0.000 0% Clause clause subsumption (78 calls)
% 0.46/0.63 ; 0.005 3% Forward simplification (400 calls)
% 0.46/0.63 ; 0.009 6% Backward simplification (356 calls)
% 0.46/0.63 ; 0.000 0% Ordering (80 calls)
% 0.46/0.63 ; 0.000 0% Sortal reasoning (32 calls)
% 0.46/0.63 ; 0.000 0% Purity testing (1 call)
% 0.46/0.63 ; 0.018 12% Other
% 0.46/0.63 ; 0.150 Total
% 0.46/0.63 ; 0.154 Real time
% 0.46/0.63 ;
% 0.46/0.63 ; Term-hash-array has 394 terms in all.
% 0.46/0.63 ; Feature-vector-row-index has 21 entries (75 at peak, 131 added, 110 deleted).
% 0.46/0.63 ; Feature-vector-row-index has 163 nodes (345 at peak, 803 added, 640 deleted).
% 0.46/0.63 ; Retrieved 36 possibly forward subsuming rows in 131 calls.
% 0.46/0.63 ; Retrieved 42 possibly backward subsumed rows in 131 calls.
% 0.46/0.63 ; Path-index has 209 entries (329 at peak, 463 added, 254 deleted).
% 0.46/0.63 ; Path-index has 82 nodes (90 at peak, 90 added, 8 deleted).
% 0.46/0.63 ; Trie-index has 209 entries (329 at peak, 463 added, 254 deleted).
% 0.46/0.63 ; Trie-index has 417 nodes (645 at peak, 860 added, 443 deleted).
% 0.46/0.63 ; Retrieved 117 generalization terms in 1,080 calls.
% 0.46/0.63 ; Retrieved 224 instance terms in 224 calls.
% 0.46/0.63 ;
% 0.46/0.63 ; The agenda of backward simplifiable rows to process has 90 entries:
% 0.46/0.63 ; 90 with value 0
% 0.46/0.63 ; The agenda of input rows to give has 126 entries:
% 0.46/0.63 ; 10 with value 4 24 with value 10 19 with value 21
% 0.46/0.63 ; 35 with value 7 12 with value 12 2 with value 28
% 0.46/0.63 ; 24 with value 9
% 0.46/0.63 Evaluation took:
% 0.46/0.63 0.154 seconds of real time
% 0.46/0.63 0.149794 seconds of user run time
% 0.46/0.63 0.004011 seconds of system run time
% 0.46/0.63 0 calls to %EVAL
% 0.46/0.63 0 page faults and
% 0.46/0.63 9,668,040 bytes consed.
% 0.46/0.63 :PROOF-FOUND
% 0.46/0.63 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-08T21:05:23
% 0.46/0.63 :PROOF-FOUND
% 0.46/0.63 *
%------------------------------------------------------------------------------