TSTP Solution File: NUM847+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM847+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n007.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 10:41:00 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 20
% Syntax : Number of formulae : 32 ( 16 unt; 16 typ; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 12 >; 10 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
vd436: $i ).
tff(decl_23,type,
vd437: $i ).
tff(decl_24,type,
vmul: ( $i * $i ) > $i ).
tff(decl_25,type,
vd439: $i ).
tff(decl_26,type,
vplus: ( $i * $i ) > $i ).
tff(decl_27,type,
vsucc: $i > $i ).
tff(decl_28,type,
v1: $i ).
tff(decl_29,type,
less: ( $i * $i ) > $o ).
tff(decl_30,type,
leq: ( $i * $i ) > $o ).
tff(decl_31,type,
greater: ( $i * $i ) > $o ).
tff(decl_32,type,
geq: ( $i * $i ) > $o ).
tff(decl_33,type,
vskolem2: $i > $i ).
tff(decl_34,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_35,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_36,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_37,type,
esk4_2: ( $i * $i ) > $i ).
fof('ass(cond(270, 0), 0)',axiom,
! [X1,X2] : vmul(X1,X2) = vmul(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(270, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X71,X72] : vplus(X72,X71) = vplus(X71,X72),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X76,X77,X78] : vplus(vplus(X76,X77),X78) = vplus(X76,vplus(X77,X78)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof('holds(286, 441, 3)',conjecture,
vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436) = vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(286, 441, 3)') ).
fof(c_0_4,plain,
! [X88,X89] : vmul(X88,X89) = vmul(X89,X88),
inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).
fof(c_0_5,plain,
! [X192,X193] : vplus(X193,X192) = vplus(X192,X193),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_6,plain,
! [X197,X198,X199] : vplus(vplus(X197,X198),X199) = vplus(X197,vplus(X198,X199)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
fof(c_0_7,negated_conjecture,
vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436) != vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(286, 441, 3)'])]) ).
cnf(c_0_8,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436) != vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
vmul(X1,X2) = vmul(X2,X1),
c_0_8 ).
cnf(c_0_13,plain,
vplus(X1,X2) = vplus(X2,X1),
c_0_9 ).
cnf(c_0_14,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
c_0_10 ).
cnf(c_0_15,negated_conjecture,
$false,
inference(ar,[status(thm)],[c_0_11,c_0_12,c_0_13,c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM847+1 : TPTP v8.1.2. Released v4.1.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n007.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 : 300
% 0.13/0.34 % DateTime : Fri Aug 25 08:01:55 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.59 % Total time : 0.008000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.012000 s
%------------------------------------------------------------------------------