TSTP Solution File: KLE066+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE066+1 : TPTP v8.1.0. Released v4.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 02:26:28 EDT 2022
% Result : Theorem 0.47s 0.65s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 5 RR)
% Number of literals : 13 ( 12 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
multiplication(one,X) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
cnf(8,axiom,
multiplication(addition(X,Y),Z) = addition(multiplication(X,Z),multiplication(Y,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
cnf(10,axiom,
multiplication(zero,X) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
cnf(13,axiom,
addition(X,multiplication(domain(X),X)) = multiplication(domain(X),X),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).
cnf(15,axiom,
domain(multiplication(X,Y)) = domain(multiplication(X,domain(Y))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).
cnf(16,axiom,
addition(domain(X),one) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain3) ).
cnf(18,axiom,
domain(zero) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain4) ).
cnf(21,negated_conjecture,
multiplication('SKOLEMAAAU1',domain('SKOLEMAAAU2')) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(22,negated_conjecture,
multiplication('SKOLEMAAAU1','SKOLEMAAAU2') != zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(48,plain,
domain(multiplication('SKOLEMAAAU1','SKOLEMAAAU2')) = zero,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,21,theory(equality)]),18,theory(equality)]) ).
cnf(116,plain,
X = addition(X,multiplication(domain(Y),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,16,theory(equality)]),6,theory(equality)]) ).
cnf(150,plain,
multiplication(domain(X),X) = X,
inference('REWRITE',[status(thm)],[13,116,theory(equality)]) ).
cnf(173,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[150,48,theory(equality)]),22,10,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KLE066+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 15:15:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-06-16T15:15:34
% 0.20/0.47 ; 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-16T15:15:34
% 0.20/0.49
% 0.20/0.49 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.20/0.49 ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.20/0.49 ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.20/0.49 ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.20/0.49 ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.20/0.49 ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.20/0.49 ; Declaring addition to be commutative.
% 0.47/0.65 ; Declaring addition to be associative-commutative.
% 0.47/0.65
% 0.47/0.65 #||
% 0.47/0.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.65 % SZS output start Refutation
% See solution above
% 0.47/0.66 ||#
% 0.47/0.66
% 0.47/0.66 ; Summary of computation:
% 0.47/0.66 ; 665 formulas have been input or derived (from 32 formulas).
% 0.47/0.66 ; 173 (26%) were retained. Of these,
% 0.47/0.66 ; 94 (54%) were simplified or subsumed later,
% 0.47/0.66 ; 79 (46%) are still being kept.
% 0.47/0.66 ;
% 0.47/0.66 ; Run time in seconds excluding printing time:
% 0.47/0.66 ; 0.004 2% Read assertion file (1 call)
% 0.47/0.66 ; 0.001 1% Assert (18 calls)
% 0.47/0.66 ; 0.019 10% Process new row (637 calls)
% 0.47/0.66 ; 0.002 1% Resolution (62 calls)
% 0.47/0.66 ; 0.015 8% Paramodulation (31 calls)
% 0.47/0.66 ; 0.003 2% Embedding (51 calls)
% 0.47/0.66 ; 0.007 4% Condensing (80 calls)
% 0.47/0.66 ; 0.004 2% Forward subsumption (80 calls)
% 0.47/0.66 ; 0.001 1% Backward subsumption (34 calls)
% 0.47/0.66 ; 0.001 1% Clause clause subsumption (185 calls)
% 0.47/0.66 ; 0.063 35% Forward simplification (575 calls)
% 0.47/0.66 ; 0.018 10% Backward simplification (131 calls)
% 0.47/0.66 ; 0.005 3% Ordering (895 calls)
% 0.47/0.66 ; 0.011 6% Ordering ac (545 calls)
% 0.47/0.66 ; 0.000 0% Sortal reasoning (32 calls)
% 0.47/0.66 ; 0.000 0% Purity testing (1 call)
% 0.47/0.66 ; 0.027 15% Other
% 0.47/0.66 ; 0.181 Total
% 0.47/0.66 ; 0.188 Real time
% 0.47/0.66 ;
% 0.47/0.66 ; Term-hash-array has 475 terms in all.
% 0.47/0.66 ; Feature-vector-row-index has 15 entries (27 at peak, 34 added, 19 deleted).
% 0.47/0.66 ; Feature-vector-row-index has 89 nodes (226 at peak, 308 added, 219 deleted).
% 0.47/0.66 ; Retrieved 220 possibly forward subsuming rows in 80 calls.
% 0.47/0.66 ; Retrieved 7 possibly backward subsumed rows in 34 calls.
% 0.47/0.66 ; Path-index has 220 entries (347 at peak, 529 added, 309 deleted).
% 0.47/0.66 ; Path-index has 360 nodes (399 at peak, 458 added, 98 deleted).
% 0.47/0.66 ; Trie-index has 220 entries (347 at peak, 529 added, 309 deleted).
% 0.47/0.66 ; Trie-index has 310 nodes (339 at peak, 410 added, 100 deleted).
% 0.47/0.66 ; Retrieved 36,055 generalization terms in 6,865 calls.
% 0.47/0.66 ; Retrieved 694 instance terms in 123 calls.
% 0.47/0.66 ; Retrieved 808 unifiable terms in 163 calls.
% 0.47/0.66 ;
% 0.47/0.66 ; The agenda of rows to process has 3 entries:
% 0.47/0.66 ; 3 with value 17
% 0.47/0.66 ; The agenda of rows to give has 49 entries:
% 0.47/0.66 ; 1 with value (4 10) 3 with value (4 17) 3 with value (4 24)
% 0.47/0.66 ; 1 with value (4 11) 2 with value (4 18) 1 with value (4 25)
% 0.47/0.66 ; 2 with value (4 12) 2 with value (4 19) 1 with value (4 26)
% 0.47/0.66 ; 7 with value (4 13) 7 with value (4 20) 6 with value (4 28)
% 0.47/0.66 ; 1 with value (4 14) 4 with value (4 21) 1 with value (4 30)
% 0.47/0.66 ; 4 with value (4 15) 1 with value (4 23) 2 with value (4 33)
% 0.47/0.66 Evaluation took:
% 0.47/0.66 0.188 seconds of real time
% 0.47/0.66 0.175334 seconds of user run time
% 0.47/0.66 0.012655 seconds of system run time
% 0.47/0.66 [Run times include 0.005 seconds GC run time.]
% 0.47/0.66 0 calls to %EVAL
% 0.47/0.66 0 page faults and
% 0.47/0.66 12,748,120 bytes consed.
% 0.47/0.66 :PROOF-FOUND
% 0.47/0.66 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T15:15:34
% 0.47/0.66 :PROOF-FOUND
% 0.47/0.66 *
%------------------------------------------------------------------------------