TSTP Solution File: ROB023-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : ROB023-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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:56:02 EDT 2022
% Result : Unsatisfiable 0.34s 0.52s
% Output : Refutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 2 RR)
% Number of literals : 13 ( 12 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 13 ( 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(x_plus_x_is_x,hypothesis,
add(X,X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_plus_x_is_x) ).
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(X),negate(add(X,negate(X))))) = X,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,x_plus_x_is_x,theory(equality)]) ).
cnf(6,plain,
negate(add(negate(add(X,negate(X))),negate(negate(X)))) = negate(X),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,x_plus_x_is_x,theory(equality)]) ).
cnf(16,plain,
negate(add(negate(add(X,negate(X))),X)) = negate(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,5,theory(equality)]),x_plus_x_is_x,theory(equality)]) ).
cnf(19,plain,
negate(add(X,negate(add(negate(X),add(negate(add(X,negate(X))),X))))) = add(negate(X),negate(add(X,negate(X)))),
inference('PARAMODULATE',[status(thm)],[5,5,theory(equality)]) ).
cnf(24,plain,
negate(add(negate(X),negate(add(negate(X),add(negate(add(X,negate(X))),X))))) = add(negate(add(X,negate(X))),X),
inference('PARAMODULATE',[status(thm)],[5,16,theory(equality)]) ).
cnf(32,plain,
add(negate(add(X,negate(X))),X) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,5,theory(equality)]),24,theory(equality)]) ).
cnf(34,plain,
negate(X) = add(negate(X),negate(add(X,negate(X)))),
inference('REWRITE',[status(thm)],[19,32,theory(equality)]) ).
cnf(36,plain,
negate(negate(X)) = X,
inference('REWRITE',[status(thm)],[5,34,theory(equality)]) ).
cnf(37,plain,
negate(X) = add(negate(add(X,Y)),negate(add(X,negate(Y)))),
inference('PARAMODULATE',[status(thm)],[36,robbins_axiom,theory(equality)]) ).
cnf(39,plain,
$false,
inference('REWRITE',[status(thm)],[prove_huntingtons_axiom,36,37,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : ROB023-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 15:03:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T15:03:08
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-09T15:03:08
% 0.18/0.47
% 0.18/0.47 ; Recognized commutativity assertion (= (|add| ?X ?Y) (|add| ?Y ?X)).
% 0.18/0.47 ; Recognized associativity assertion (= (|add| (|add| ?X ?Y) ?Z) (|add| ?X (|add| ?Y ?Z))).
% 0.18/0.47 ; Declaring add to be commutative.
% 0.34/0.52 ; Declaring add to be associative-commutative.
% 0.34/0.52
% 0.34/0.52 #||
% 0.34/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.34/0.52 % SZS output start Refutation
% See solution above
% 0.34/0.52 ||#
% 0.34/0.52
% 0.34/0.52 ; Summary of computation:
% 0.34/0.52 ; 116 formulas have been input or derived (from 9 formulas).
% 0.34/0.52 ; 39 (34%) were retained. Of these,
% 0.34/0.52 ; 20 (51%) were simplified or subsumed later,
% 0.34/0.52 ; 19 (49%) are still being kept.
% 0.34/0.52 ;
% 0.34/0.52 ; Run time in seconds excluding printing time:
% 0.34/0.52 ; 0.001 2% Read assertion file (1 call)
% 0.34/0.52 ; 0.001 2% Assert (5 calls)
% 0.34/0.52 ; 0.010 17% Process new row (115 calls)
% 0.34/0.52 ; 0.000 0% Resolution (16 calls)
% 0.34/0.52 ; 0.006 10% Paramodulation (8 calls)
% 0.34/0.52 ; 0.000 0% Embedding (12 calls)
% 0.34/0.52 ; 0.010 17% Forward simplification (100 calls)
% 0.34/0.52 ; 0.008 14% Backward simplification (35 calls)
% 0.34/0.52 ; 0.002 3% Ordering (153 calls)
% 0.34/0.52 ; 0.000 0% Ordering ac (26 calls)
% 0.34/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.34/0.52 ; 0.000 0% Purity testing (1 call)
% 0.34/0.52 ; 0.021 36% Other
% 0.34/0.52 ; 0.059 Total
% 0.34/0.52 ; 0.062 Real time
% 0.34/0.52 ;
% 0.34/0.52 ; Term-hash-array has 181 terms in all.
% 0.34/0.52 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.34/0.52 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.34/0.52 ; Path-index has 86 entries (172 at peak, 184 added, 98 deleted).
% 0.34/0.52 ; Path-index has 99 nodes (136 at peak, 137 added, 38 deleted).
% 0.34/0.52 ; Trie-index has 86 entries (172 at peak, 184 added, 98 deleted).
% 0.34/0.52 ; Trie-index has 23 nodes (31 at peak, 32 added, 9 deleted).
% 0.34/0.52 ; Retrieved 3,951 generalization terms in 897 calls.
% 0.34/0.52 ; Retrieved 243 instance terms in 34 calls.
% 0.34/0.52 ; Retrieved 213 unifiable terms in 60 calls.
% 0.34/0.52 ;
% 0.34/0.52 ; The agenda of rows to process has 1 entry:
% 0.34/0.52 ; 1 with value 21
% 0.34/0.52 ; The agenda of rows to give has 15 entries:
% 0.34/0.52 ; 2 with value (4 16) 1 with value (4 24) 1 with value (4 37)
% 0.34/0.52 ; 2 with value (4 18) 2 with value (4 26) 1 with value (4 45)
% 0.34/0.52 ; 2 with value (4 20) 1 with value (4 28) 1 with value (4 50)
% 0.34/0.52 ; 1 with value (4 23) 1 with value (4 29)
% 0.34/0.52 Evaluation took:
% 0.34/0.52 0.063 seconds of real time
% 0.34/0.52 0.060017 seconds of user run time
% 0.34/0.52 0.002151 seconds of system run time
% 0.34/0.52 0 calls to %EVAL
% 0.34/0.52 0 page faults and
% 0.34/0.52 4,025,064 bytes consed.
% 0.34/0.52 :PROOF-FOUND
% 0.34/0.52 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T15:03:08
% 0.34/0.52 :PROOF-FOUND
% 0.34/0.52 *
%------------------------------------------------------------------------------