TSTP Solution File: NUN073+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUN073+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/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:53 EDT 2023
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 34
% Syntax : Number of formulae : 68 ( 16 unt; 29 typ; 0 def)
% Number of atoms : 107 ( 43 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 130 ( 62 ~; 49 |; 19 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 25 ( 25 usr; 6 con; 0-2 aty)
% Number of variables : 61 ( 2 sgn; 40 !; 4 ?; 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 ).
tff(decl_46,type,
esk21_0: $i ).
tff(decl_47,type,
esk22_0: $i ).
tff(decl_48,type,
esk23_0: $i ).
tff(decl_49,type,
esk24_0: $i ).
tff(decl_50,type,
esk25_0: $i ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(oneuneqtwo,conjecture,
! [X39] :
( ! [X22] :
( ! [X16] :
( ~ r1(X16)
| ~ r2(X16,X22) )
| X22 != X39 )
| ! [X23] :
( ! [X17] :
( ~ r1(X17)
| ~ r2(X17,X23) )
| ~ r2(X23,X39) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oneuneqtwo) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
fof(axiom_3a,axiom,
! [X26,X27] :
( ! [X28] :
( ! [X29] :
( ~ r2(X26,X29)
| X29 != X28 )
| ~ r2(X27,X28) )
| X26 = X27 ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_3a) ).
fof(axiom_7a,axiom,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).
fof(c_0_5,plain,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_6,negated_conjecture,
~ ! [X39] :
( ! [X22] :
( ! [X16] :
( ~ r1(X16)
| ~ r2(X16,X22) )
| X22 != X39 )
| ! [X23] :
( ! [X17] :
( ~ r1(X17)
| ~ r2(X17,X23) )
| ~ r2(X23,X39) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[oneuneqtwo])]) ).
fof(c_0_7,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_5])])]) ).
fof(c_0_8,negated_conjecture,
( r1(esk23_0)
& r2(esk23_0,esk22_0)
& esk22_0 = esk21_0
& r1(esk25_0)
& r2(esk25_0,esk24_0)
& r2(esk24_0,esk21_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_10,plain,
( X1 = esk1_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
r1(esk25_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X26,X27] :
( ! [X28] :
( ! [X29] :
( ~ r2(X26,X29)
| X29 != X28 )
| ~ r2(X27,X28) )
| X26 = X27 ),
inference(fof_simplification,[status(thm)],[axiom_3a]) ).
fof(c_0_13,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_9])])]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk25_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
r2(esk23_0,esk22_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
esk22_0 = esk21_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_17,plain,
! [X69,X70,X71,X72] :
( ~ r2(X69,X72)
| X72 != X71
| ~ r2(X70,X71)
| X69 = X70 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
cnf(c_0_18,plain,
( X1 = esk2_1(X2)
| ~ r2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
r2(esk25_0,esk24_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( X1 = esk25_0
| ~ r1(X1) ),
inference(rw,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
r1(esk23_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,negated_conjecture,
r2(esk23_0,esk21_0),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_23,plain,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
cnf(c_0_24,plain,
( X1 = X4
| ~ r2(X1,X2)
| X2 != X3
| ~ r2(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
esk2_1(esk25_0) = esk24_0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
esk25_0 = esk23_0,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
esk2_1(esk23_0) = esk21_0,
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
fof(c_0_28,plain,
! [X84,X85,X86] :
( ~ r1(X86)
| X86 != X85
| ~ r2(X84,X85) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_23])]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ r2(X2,X3)
| ~ r2(X1,X3) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
r2(esk24_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_31,negated_conjecture,
esk24_0 = esk21_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_32,plain,
( ~ r1(X1)
| X1 != X2
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( X1 = esk23_0
| ~ r2(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_34,negated_conjecture,
r2(esk21_0,esk21_0),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_36,negated_conjecture,
esk23_0 = esk21_0,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
~ r1(esk21_0),
inference(spm,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN073+2 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n020.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 : Sun Aug 27 09:27:59 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.59 % Total time : 0.008000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.011000 s
%------------------------------------------------------------------------------