TSTP Solution File: ROB004-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : ROB004-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n022.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 : 300s
% DateTime : Thu Aug 31 14:07:15 EDT 2023
% Result : Unsatisfiable 0.23s 0.72s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 39 ( 33 unt; 6 typ; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
add: ( $i * $i ) > $i ).
tff(decl_23,type,
negate: $i > $i ).
tff(decl_24,type,
d: $i ).
tff(decl_25,type,
c: $i ).
tff(decl_26,type,
a: $i ).
tff(decl_27,type,
b: $i ).
cnf(robbins_axiom,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).
cnf(negate_d_is_c,hypothesis,
negate(d) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',negate_d_is_c) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).
cnf(associativity_of_add,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).
cnf(c_plus_d_is_d,hypothesis,
add(c,d) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_plus_d_is_d) ).
cnf(c_plus_c_is_c,hypothesis,
add(c,c) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_plus_c_is_c) ).
cnf(prove_huntingtons_axiom,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_huntingtons_axiom) ).
cnf(c_0_7,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_8,hypothesis,
negate(d) = c,
negate_d_is_c ).
cnf(c_0_9,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_10,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_11,hypothesis,
add(c,d) = d,
c_plus_d_is_d ).
cnf(c_0_12,hypothesis,
negate(add(negate(add(X1,c)),negate(add(X1,d)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_13,hypothesis,
add(c,c) = c,
c_plus_c_is_c ).
cnf(c_0_14,hypothesis,
add(c,add(d,X1)) = add(d,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,hypothesis,
negate(add(negate(add(c,X1)),negate(add(X1,d)))) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_16,hypothesis,
add(c,add(c,X1)) = add(c,X1),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_17,hypothesis,
add(c,add(X1,d)) = add(X1,d),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_18,plain,
negate(add(negate(add(X1,X2)),negate(add(X1,add(negate(add(X2,X3)),negate(add(X2,negate(X3)))))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_7]),c_0_9]) ).
cnf(c_0_19,hypothesis,
add(c,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_10]),c_0_17]),c_0_15]) ).
cnf(c_0_20,hypothesis,
negate(add(X1,negate(X1))) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_7]),c_0_9]) ).
cnf(c_0_21,hypothesis,
add(X1,c) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_22,hypothesis,
negate(negate(add(X1,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_20]),c_0_21]) ).
cnf(c_0_23,hypothesis,
negate(add(X1,negate(add(X1,X1)))) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_22]),c_0_9]) ).
cnf(c_0_24,hypothesis,
negate(negate(add(X1,negate(negate(X1))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_20]),c_0_19]) ).
cnf(c_0_25,hypothesis,
negate(negate(add(X1,add(X1,X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_23]),c_0_21]) ).
cnf(c_0_26,hypothesis,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_10]),c_0_25]) ).
cnf(c_0_27,hypothesis,
negate(negate(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_26]),c_0_20]),c_0_21]) ).
cnf(c_0_28,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X2),X1)))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_29,hypothesis,
add(negate(add(X1,X2)),negate(add(negate(X2),X1))) = negate(X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
prove_huntingtons_axiom ).
cnf(c_0_31,hypothesis,
add(negate(add(X1,X2)),negate(add(negate(X1),X2))) = negate(X2),
inference(spm,[status(thm)],[c_0_29,c_0_9]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.16 % Problem : ROB004-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.17 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.16/0.38 % Computer : n022.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon Aug 28 06:53:24 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.63 start to proof: theBenchmark
% 0.23/0.72 % Version : CSE_E---1.5
% 0.23/0.72 % Problem : theBenchmark.p
% 0.23/0.72 % Proof found
% 0.23/0.72 % SZS status Theorem for theBenchmark.p
% 0.23/0.72 % SZS output start Proof
% See solution above
% 0.23/0.73 % Total time : 0.088000 s
% 0.23/0.73 % SZS output end Proof
% 0.23/0.73 % Total time : 0.090000 s
%------------------------------------------------------------------------------