%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : FLD067-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n025.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 : Sat Jul 16 02:27:19 EDT 2022
% Result : Unsatisfiable 1.53s 1.70s
% Output : Refutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 19 ( 0 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_inverse_addition,axiom,
( sum(additive_inverse(X),X,additive_identity)
| ~ defined(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X))
| ~ defined(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_inverse) ).
cnf(totality_of_addition,axiom,
( sum(X,Y,add(X,Y))
| ~ defined(X)
| ~ defined(Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( less_or_equal(X,Y)
| ~ less_or_equal(Z,U)
| ~ sum(Z,V,X)
| ~ sum(U,V,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_3) ).
cnf(not_less_or_equal_4,negated_conjecture,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_4) ).
cnf(36,plain,
defined(additive_inverse(a)),
inference('HYPERRESOLVE',[status(thm)],[well_definedness_of_additive_inverse,a_is_defined]) ).
cnf(40,plain,
sum(additive_inverse(a),a,additive_identity),
inference('HYPERRESOLVE',[status(thm)],[existence_of_inverse_addition,a_is_defined]) ).
cnf(215,plain,
sum(b,additive_inverse(a),add(b,additive_inverse(a))),
inference('HYPERRESOLVE',[status(thm)],[totality_of_addition,36,b_is_defined]) ).
cnf(7868,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[compatibility_of_order_relation_and_addition,40,not_less_or_equal_4,less_or_equal_3]),215]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : FLD067-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.10/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 7 02:49:48 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 /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-07T02:49:48
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n025.cluster.edu at 2022-06-07T02:49:48
% 0.20/0.49
% 0.20/0.49 ; Recognized possible associativity assertion (OR (|sum| ?X ?Y ?Z) (NOT (|sum| ?X ?U ?V)) (NOT (|sum| ?U ?W ?Y)) (NOT (|sum| ?V ?W ?Z))).
% 0.20/0.49 ; Recognized possible associativity assertion (OR (|sum| ?X ?Y ?Z) (NOT (|sum| ?U ?V ?X)) (NOT (|sum| ?V ?Y ?W)) (NOT (|sum| ?U ?W ?Z))).
% 0.20/0.49 ; Recognized commutativity assertion (OR (|sum| ?X ?Y ?Z) (NOT (|sum| ?Y ?X ?Z))).
% 0.20/0.49 ; Recognized possible associativity assertion (OR (|product| ?X ?Y ?Z) (NOT (|product| ?X ?U ?V)) (NOT (|product| ?U ?W ?Y)) (NOT (|product| ?V ?W ?Z))).
% 0.20/0.49 ; Recognized possible associativity assertion (OR (|product| ?X ?Y ?Z) (NOT (|product| ?U ?V ?X)) (NOT (|product| ?V ?Y ?W)) (NOT (|product| ?U ?W ?Z))).
% 0.20/0.49 ; Recognized commutativity assertion (OR (|product| ?X ?Y ?Z) (NOT (|product| ?Y ?X ?Z))).
% 0.20/0.49 ; Declaring sum to be commutative.
% 1.53/1.70 ; Declaring product to be commutative.
% 1.53/1.70
% 1.53/1.70 #||
% 1.53/1.70 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.53/1.70 % SZS output start Refutation
% See solution above
% 1.53/1.70 ||#
% 1.53/1.70
% 1.53/1.70 ; Summary of computation:
% 1.53/1.70 ; 16257 formulas have been input or derived (from 81 formulas).
% 1.53/1.70 ; 7868 (48%) were retained. Of these,
% 1.53/1.70 ; 2 ( 0%) were simplified or subsumed later,
% 1.53/1.70 ; 7866 (100%) are still being kept.
% 1.53/1.70 ;
% 1.53/1.70 ; Run time in seconds excluding printing time:
% 1.53/1.70 ; 0.007 1% Read assertion file (1 call)
% 1.53/1.70 ; 0.001 0% Assert (30 calls)
% 1.53/1.70 ; 0.529 43% Process new row (16,065 calls)
% 1.53/1.70 ; 0.343 28% Resolution (160 calls)
% 1.53/1.70 ; 0.002 0% Paramodulation (80 calls)
% 1.53/1.70 ; 0.004 0% Condensing (1,736 calls)
% 1.53/1.70 ; 0.055 5% Forward subsumption (1,736 calls)
% 1.53/1.70 ; 0.020 2% Backward subsumption (916 calls)
% 1.53/1.70 ; 0.011 1% Clause clause subsumption (5,159 calls)
% 1.53/1.70 ; 0.097 8% Forward simplification (16,065 calls)
% 1.53/1.70 ; 0.064 5% Backward simplification (7,868 calls)
% 1.53/1.70 ; 0.000 0% Ordering (468 calls)
% 1.53/1.70 ; 0.000 0% Sortal reasoning (32 calls)
% 1.53/1.70 ; 0.000 0% Purity testing (1 call)
% 1.53/1.70 ; 0.086 7% Other
% 1.53/1.70 ; 1.219 Total
% 1.53/1.70 ; 1.227 Real time
% 1.53/1.70 ;
% 1.53/1.70 ; Term-hash-array has 12,190 terms in all.
% 1.53/1.70 ; Feature-vector-row-index has 914 entries (914 at peak, 916 added, 2 deleted).
% 1.53/1.70 ; Feature-vector-row-index has 737 nodes (737 at peak, 749 added, 12 deleted).
% 1.53/1.70 ; Retrieved 13,179 possibly forward subsuming rows in 1,736 calls.
% 1.53/1.70 ; Retrieved 5,876 possibly backward subsumed rows in 916 calls.
% 1.53/1.70 ; Path-index has 12,194 entries (12,194 at peak, 12,197 added, 3 deleted).
% 1.53/1.70 ; Path-index has 829 nodes (829 at peak, 832 added, 3 deleted).
% 1.53/1.70 ; Trie-index has 12,194 entries (12,194 at peak, 12,197 added, 3 deleted).
% 1.53/1.70 ; Trie-index has 34,653 nodes (34,653 at peak, 34,657 added, 4 deleted).
% 1.53/1.70 ; Retrieved 7,376 generalization terms in 17,772 calls.
% 1.53/1.70 ; Retrieved 6,954 instance terms in 6,951 calls.
% 1.53/1.70 ; Retrieved 874,381 unifiable terms in 3,428 calls.
% 1.53/1.70 ;
% 1.53/1.70 ; The agenda of rows to process has 1 entry:
% 1.53/1.70 ; 1 with value 13
% 1.53/1.70 ; The agenda of rows to give has 7785 entries:
% 1.53/1.70 ; 6 with value (4 8) 2131 with value (4 13) 192 with value (4 18)
% 1.53/1.70 ; 49 with value (4 9) 52 with value (4 14) 2052 with value (4 19)
% 1.53/1.70 ; 122 with value (4 10) 562 with value (4 15) 496 with value (4 20)
% 1.53/1.70 ; 598 with value (4 11) 142 with value (4 16) 32 with value (4 22)
% 1.53/1.70 ; 711 with value (4 12) 640 with value (4 17)
% 1.53/1.70 Evaluation took:
% 1.53/1.70 1.228 seconds of real time
% 1.53/1.70 1.120781 seconds of user run time
% 1.53/1.70 0.101112 seconds of system run time
% 1.53/1.70 [Run times include 0.136 seconds GC run time.]
% 1.53/1.70 0 calls to %EVAL
% 1.53/1.70 0 page faults and
% 1.53/1.70 80,519,984 bytes consed.
% 1.53/1.70 :PROOF-FOUND
% 1.53/1.70 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-07T02:49:50
% 1.53/1.70 :PROOF-FOUND
% 1.53/1.70 *
%------------------------------------------------------------------------------