TSTP Solution File: ROB005-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : ROB005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n027.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 : Mon Jul 18 20:55:58 EDT 2022
% Result : Unsatisfiable 1.06s 1.24s
% Output : Refutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 10 RR)
% Number of literals : 26 ( 25 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(robbins_axiom,axiom,
negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))) = X,
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).
cnf(idempotence,hypothesis,
add(c,c) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence) ).
cnf(3,plain,
add(c,add(c,X)) = add(c,X),
inference('EMBED',[status(thm)],[idempotence]) ).
cnf(prove_huntingtons_axiom,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_huntingtons_axiom) ).
cnf(5,plain,
negate(add(negate(c),negate(add(c,negate(c))))) = c,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,idempotence,theory(equality)]) ).
cnf(7,plain,
negate(add(negate(add(c,X)),negate(add(X,add(c,negate(c)))))) = add(c,X),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,3,theory(equality)]) ).
cnf(8,plain,
negate(add(negate(add(negate(add(X,Y)),add(X,negate(Y)))),X)) = negate(add(X,Y)),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,robbins_axiom,theory(equality)]) ).
cnf(9,plain,
negate(add(negate(add(negate(add(X,negate(Y))),add(X,Y))),X)) = negate(add(X,negate(Y))),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,robbins_axiom,theory(equality)]) ).
cnf(14,plain,
negate(add(negate(add(negate(c),add(c,negate(c)))),c)) = negate(c),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,5,theory(equality)]) ).
cnf(18,plain,
negate(add(negate(add(X,add(negate(c),negate(add(c,negate(c)))))),negate(add(c,X)))) = X,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,5,theory(equality)]) ).
cnf(19,plain,
negate(add(negate(add(negate(c),add(c,negate(c)))),negate(c))) = c,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,14,theory(equality)]),idempotence,theory(equality)]) ).
cnf(22,plain,
negate(add(c,negate(c))) = negate(add(negate(c),add(c,negate(c)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,14,theory(equality)]),19,theory(equality)]) ).
cnf(23,plain,
negate(add(negate(add(c,negate(c))),c)) = negate(c),
inference('REWRITE',[status(thm)],[14,22,theory(equality)]) ).
cnf(37,plain,
negate(add(negate(c),negate(add(negate(add(c,negate(c))),add(c,negate(c)))))) = add(negate(add(c,negate(c))),c),
inference('PARAMODULATE',[status(thm)],[7,23,theory(equality)]) ).
cnf(201,plain,
add(negate(add(c,negate(c))),c) = c,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,idempotence,theory(equality)]),37,theory(equality)]) ).
cnf(202,plain,
add(X,add(negate(add(c,negate(c))),c)) = add(c,X),
inference('EMBED',[status(thm)],[201]) ).
cnf(235,plain,
X = add(X,negate(add(c,negate(c)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,202,theory(equality)]),18,theory(equality)]) ).
cnf(251,plain,
negate(negate(add(negate(X),negate(X)))) = negate(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,235,theory(equality)]),235,theory(equality)]) ).
cnf(252,plain,
negate(negate(add(X,negate(negate(X))))) = negate(negate(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,235,theory(equality)]),235,theory(equality)]) ).
cnf(292,plain,
negate(negate(add(X,X))) = X,
inference('PARAMODULATE',[status(thm)],[251,robbins_axiom,theory(equality)]) ).
cnf(299,plain,
negate(negate(add(X,add(X,X)))) = X,
inference('PARAMODULATE',[status(thm)],[252,292,theory(equality)]) ).
cnf(323,plain,
add(X,X) = add(X,add(X,X)),
inference('PARAMODULATE',[status(thm)],[292,299,theory(equality)]) ).
cnf(325,plain,
X = add(X,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[292,323,theory(equality)]),292,323,theory(equality)]) ).
cnf(334,plain,
negate(negate(X)) = X,
inference('REWRITE',[status(thm)],[292,325,theory(equality)]) ).
cnf(352,plain,
negate(X) = add(negate(add(X,Y)),negate(add(X,negate(Y)))),
inference('PARAMODULATE',[status(thm)],[334,robbins_axiom,theory(equality)]) ).
cnf(354,plain,
$false,
inference('REWRITE',[status(thm)],[prove_huntingtons_axiom,334,352,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ROB005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n027.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 9 14:49:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T14:49:43
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-06-09T14:49:43
% 0.19/0.49
% 0.19/0.49 ; Recognized commutativity assertion (= (|add| ?X ?Y) (|add| ?Y ?X)).
% 0.19/0.49 ; Recognized associativity assertion (= (|add| (|add| ?X ?Y) ?Z) (|add| ?X (|add| ?Y ?Z))).
% 0.19/0.49 ; Declaring add to be commutative.
% 1.06/1.24 ; Declaring add to be associative-commutative.
% 1.06/1.24
% 1.06/1.24 #||
% 1.06/1.24 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.06/1.24 % SZS output start Refutation
% See solution above
% 1.06/1.24 ||#
% 1.06/1.24
% 1.06/1.24 ; Summary of computation:
% 1.06/1.24 ; 1096 formulas have been input or derived (from 35 formulas).
% 1.06/1.24 ; 354 (32%) were retained. Of these,
% 1.06/1.24 ; 241 (68%) were simplified or subsumed later,
% 1.06/1.24 ; 113 (32%) are still being kept.
% 1.06/1.24 ;
% 1.06/1.24 ; Run time in seconds excluding printing time:
% 1.06/1.24 ; 0.002 0% Read assertion file (1 call)
% 1.06/1.24 ; 0.000 0% Assert (5 calls)
% 1.06/1.24 ; 0.066 9% Process new row (1,080 calls)
% 1.06/1.24 ; 0.001 0% Resolution (68 calls)
% 1.06/1.24 ; 0.037 5% Paramodulation (34 calls)
% 1.06/1.24 ; 0.001 0% Embedding (101 calls)
% 1.06/1.24 ; 0.452 59% Forward simplification (904 calls)
% 1.06/1.24 ; 0.082 11% Backward simplification (340 calls)
% 1.06/1.24 ; 0.006 1% Ordering (1,390 calls)
% 1.06/1.24 ; 0.086 11% Ordering ac (644 calls)
% 1.06/1.24 ; 0.000 0% Sortal reasoning (32 calls)
% 1.06/1.24 ; 0.000 0% Purity testing (1 call)
% 1.06/1.24 ; 0.029 4% Other
% 1.06/1.24 ; 0.762 Total
% 1.06/1.24 ; 0.768 Real time
% 1.06/1.24 ;
% 1.06/1.24 ; Term-hash-array has 1,770 terms in all.
% 1.06/1.24 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.06/1.24 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.06/1.24 ; Path-index has 670 entries (1,163 at peak, 1,792 added, 1,122 deleted).
% 1.06/1.24 ; Path-index has 224 nodes (324 at peak, 404 added, 180 deleted).
% 1.06/1.24 ; Trie-index has 670 entries (1,163 at peak, 1,792 added, 1,122 deleted).
% 1.06/1.24 ; Trie-index has 32 nodes (50 at peak, 66 added, 34 deleted).
% 1.06/1.24 ; Retrieved 431,571 generalization terms in 9,962 calls.
% 1.06/1.24 ; Retrieved 6,983 instance terms in 340 calls.
% 1.06/1.24 ; Retrieved 5,538 unifiable terms in 277 calls.
% 1.06/1.24 ;
% 1.06/1.24 ; The agenda of rows to process has 8 entries:
% 1.06/1.24 ; 1 with value 26 1 with value 31 1 with value 33
% 1.06/1.24 ; 1 with value 28 1 with value 32 2 with value 34
% 1.06/1.24 ; 1 with value 29
% 1.06/1.24 ; The agenda of rows to give has 105 entries:
% 1.06/1.24 ; 2 with value (4 16) 4 with value (4 40) 2 with value (4 57)
% 1.06/1.24 ; 1 with value (4 20) 4 with value (4 42) 3 with value (4 58)
% 1.06/1.24 ; 1 with value (4 24) 2 with value (4 43) 1 with value (4 59)
% 1.06/1.24 ; 3 with value (4 25) 2 with value (4 44) 3 with value (4 60)
% 1.06/1.24 ; 1 with value (4 26) 2 with value (4 45) 2 with value (4 61)
% 1.06/1.24 ; 2 with value (4 27) 2 with value (4 46) 3 with value (4 62)
% 1.06/1.24 ; 1 with value (4 29) 4 with value (4 47) 1 with value (4 63)
% 1.06/1.24 ; 5 with value (4 30) 3 with value (4 48) 1 with value (4 66)
% 1.06/1.24 ; 2 with value (4 31) 2 with value (4 49) 1 with value (4 69)
% 1.06/1.24 ; 2 with value (4 32) 2 with value (4 50) 1 with value (4 71)
% 1.06/1.24 ; 2 with value (4 33) 2 with value (4 51) 2 with value (4 72)
% 1.06/1.24 ; 4 with value (4 34) 3 with value (4 52) 2 with value (4 73)
% 1.06/1.24 ; 3 with value (4 35) 3 with value (4 53) 2 with value (4 74)
% 1.06/1.24 ; 3 with value (4 37) 1 with value (4 54) 1 with value (4 86)
% 1.06/1.24 ; 4 with value (4 38) 3 with value (4 55) 1 with value (4 87)
% 1.06/1.24 ; 2 with value (4 39) 2 with value (4 56)
% 1.06/1.24 Evaluation took:
% 1.06/1.24 0.769 seconds of real time
% 1.06/1.24 0.746943 seconds of user run time
% 1.06/1.24 0.021596 seconds of system run time
% 1.06/1.24 [Run times include 0.019 seconds GC run time.]
% 1.06/1.24 0 calls to %EVAL
% 1.06/1.24 0 page faults and
% 1.06/1.24 50,765,984 bytes consed.
% 1.06/1.24 :PROOF-FOUND
% 1.06/1.24 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T14:49:43
% 1.06/1.24 :PROOF-FOUND
% 1.06/1.24 *
%------------------------------------------------------------------------------