TSTP Solution File: NUN054+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUN054+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n020.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 12:45:44 EDT 2023
% Result : Theorem 0.19s 0.53s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 30
% Syntax : Number of formulae : 73 ( 22 unt; 24 typ; 0 def)
% Number of atoms : 144 ( 45 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 159 ( 64 ~; 50 |; 45 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 38 ( 23 >; 15 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 1 con; 0-2 aty)
% Number of variables : 113 ( 4 sgn; 30 !; 24 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
r1: $i > $o ).
tff(decl_23,type,
r2: ( $i * $i ) > $o ).
tff(decl_24,type,
r3: ( $i * $i * $i ) > $o ).
tff(decl_25,type,
r4: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
esk1_0: $i ).
tff(decl_27,type,
esk2_1: $i > $i ).
tff(decl_28,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_29,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_30,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_31,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_32,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_33,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_34,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_35,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_36,type,
esk11_2: ( $i * $i ) > $i ).
tff(decl_37,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_38,type,
esk13_1: $i > $i ).
tff(decl_39,type,
esk14_1: $i > $i ).
tff(decl_40,type,
esk15_1: $i > $i ).
tff(decl_41,type,
esk16_1: $i > $i ).
tff(decl_42,type,
esk17_1: $i > $i ).
tff(decl_43,type,
esk18_1: $i > $i ).
tff(decl_44,type,
esk19_1: $i > $i ).
tff(decl_45,type,
esk20_1: $i > $i ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(zeroplusoneeqone,conjecture,
? [X39] :
( ? [X22] :
( ? [X16] :
( r1(X16)
& r3(X16,X22,X39) )
& ? [X17] :
( r1(X17)
& r2(X17,X22) ) )
& ? [X23] :
( X39 = X23
& ? [X25] :
( r1(X25)
& r2(X25,X23) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zeroplusoneeqone) ).
fof(axiom_1a,axiom,
! [X14,X15] :
? [X16] :
( ? [X17] :
( ? [X18] :
( r2(X15,X18)
& r3(X14,X18,X17) )
& X17 = X16 )
& ? [X19] :
( r2(X19,X16)
& r3(X14,X15,X19) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).
fof(axiom_4a,axiom,
! [X30] :
? [X31] :
( ? [X32] :
( r1(X32)
& r3(X30,X32,X31) )
& X31 = X30 ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
fof(axiom_3,axiom,
! [X6,X7] :
? [X8] :
! [X9] :
( ( ~ r3(X6,X7,X9)
& X9 != X8 )
| ( r3(X6,X7,X9)
& X9 = X8 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_3) ).
fof(c_0_6,plain,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_7,plain,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_8,negated_conjecture,
~ ? [X39] :
( ? [X22] :
( ? [X16] :
( r1(X16)
& r3(X16,X22,X39) )
& ? [X17] :
( r1(X17)
& r2(X17,X22) ) )
& ? [X23] :
( X39 = X23
& ? [X25] :
( r1(X25)
& r2(X25,X23) ) ) ),
inference(assume_negation,[status(cth)],[zeroplusoneeqone]) ).
fof(c_0_9,plain,
! [X57,X58] :
( r2(X58,esk7_2(X57,X58))
& r3(X57,esk7_2(X57,X58),esk6_2(X57,X58))
& esk6_2(X57,X58) = esk5_2(X57,X58)
& r2(esk8_2(X57,X58),esk5_2(X57,X58))
& r3(X57,X58,esk8_2(X57,X58)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])]) ).
fof(c_0_10,plain,
! [X46,X48] :
( ( r2(X46,X48)
| ~ r2(X46,X48) )
& ( X48 = esk2_1(X46)
| ~ r2(X46,X48) )
& ( r2(X46,X48)
| X48 != esk2_1(X46) )
& ( X48 = esk2_1(X46)
| X48 != esk2_1(X46) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_6])])]) ).
fof(c_0_11,plain,
! [X73] :
( r1(esk14_1(X73))
& r3(X73,esk14_1(X73),esk13_1(X73))
& esk13_1(X73) = X73 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_12,plain,
! [X45] :
( ( r1(X45)
| ~ r1(X45) )
& ( X45 = esk1_0
| ~ r1(X45) )
& ( r1(X45)
| X45 != esk1_0 )
& ( X45 = esk1_0
| X45 != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])])]) ).
fof(c_0_13,negated_conjecture,
! [X87,X88,X89,X90,X91,X92] :
( ~ r1(X89)
| ~ r3(X89,X88,X87)
| ~ r1(X90)
| ~ r2(X90,X88)
| X87 != X91
| ~ r1(X92)
| ~ r2(X92,X91) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_14,plain,
r3(X1,esk7_2(X1,X2),esk6_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
esk6_2(X1,X2) = esk5_2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( X1 = esk2_1(X2)
| ~ r2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
r2(X1,esk7_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_18,plain,
! [X6,X7] :
? [X8] :
! [X9] :
( ( ~ r3(X6,X7,X9)
& X9 != X8 )
| ( r3(X6,X7,X9)
& X9 = X8 ) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_19,plain,
r3(X1,esk14_1(X1),esk13_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
esk13_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( X1 = esk1_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( ~ r1(X1)
| ~ r3(X1,X2,X3)
| ~ r1(X4)
| ~ r2(X4,X2)
| X3 != X5
| ~ r1(X6)
| ~ r2(X6,X5) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,plain,
r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_25,plain,
esk7_2(X1,X2) = esk2_1(X2),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_26,plain,
! [X49,X50,X52] :
( ( r3(X49,X50,X52)
| ~ r3(X49,X50,X52) )
& ( X52 = esk3_2(X49,X50)
| ~ r3(X49,X50,X52) )
& ( r3(X49,X50,X52)
| X52 != esk3_2(X49,X50) )
& ( X52 = esk3_2(X49,X50)
| X52 != esk3_2(X49,X50) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_18])])]) ).
cnf(c_0_27,plain,
r3(X1,esk14_1(X1),X1),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
esk14_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r2(X4,X3)
| ~ r2(X5,X2)
| ~ r1(X4)
| ~ r1(X5)
| ~ r1(X1) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
r3(X1,esk2_1(X2),esk5_2(X1,X2)),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( r1(X1)
| X1 != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,plain,
( X1 = esk3_2(X2,X3)
| ~ r3(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
r3(X1,esk1_0,X1),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
r3(X1,X2,esk8_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,negated_conjecture,
( ~ r2(X1,esk5_2(X2,X3))
| ~ r2(X4,esk2_1(X3))
| ~ r1(X1)
| ~ r1(X4)
| ~ r1(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
r1(esk1_0),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
esk3_2(X1,esk1_0) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
esk3_2(X1,X2) = esk8_2(X1,X2),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( ~ r2(esk1_0,esk5_2(X1,X2))
| ~ r2(X3,esk2_1(X2))
| ~ r1(X3)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
r2(esk8_2(X1,X2),esk5_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,plain,
esk8_2(X1,esk1_0) = X1,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( ~ r2(esk1_0,esk5_2(X1,X2))
| ~ r2(esk1_0,esk2_1(X2))
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_36]) ).
cnf(c_0_43,plain,
( r2(X1,X2)
| X2 != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_44,plain,
r2(X1,esk5_2(X1,esk1_0)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ~ r2(esk1_0,esk5_2(esk1_0,X1))
| ~ r2(esk1_0,esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_42,c_0_36]) ).
cnf(c_0_46,plain,
r2(X1,esk2_1(X1)),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_47,plain,
esk5_2(X1,esk1_0) = esk2_1(X1),
inference(spm,[status(thm)],[c_0_16,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN054+2 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n020.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.18/0.34 % CPULimit : 300
% 0.18/0.34 % WCLimit : 300
% 0.18/0.34 % DateTime : Sun Aug 27 09:34:44 EDT 2023
% 0.18/0.34 % CPUTime :
% 0.19/0.52 start to proof: theBenchmark
% 0.19/0.53 % Version : CSE_E---1.5
% 0.19/0.53 % Problem : theBenchmark.p
% 0.19/0.53 % Proof found
% 0.19/0.53 % SZS status Theorem for theBenchmark.p
% 0.19/0.53 % SZS output start Proof
% See solution above
% 0.19/0.54 % Total time : 0.010000 s
% 0.19/0.54 % SZS output end Proof
% 0.19/0.54 % Total time : 0.013000 s
%------------------------------------------------------------------------------