TSTP Solution File: NUN067+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUN067+1 : 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 : n010.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:50 EDT 2023
% Result : Theorem 0.18s 0.61s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 33
% Syntax : Number of formulae : 61 ( 8 unt; 26 typ; 0 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 135 ( 63 ~; 50 |; 22 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 41 ( 25 >; 16 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 21 ( 21 usr; 1 con; 0-2 aty)
% Number of variables : 70 ( 9 sgn; 42 !; 6 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
id: ( $i * $i ) > $o ).
tff(decl_23,type,
r1: $i > $o ).
tff(decl_24,type,
r2: ( $i * $i ) > $o ).
tff(decl_25,type,
r3: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
r4: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
esk1_0: $i ).
tff(decl_28,type,
esk2_1: $i > $i ).
tff(decl_29,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_30,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_31,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_32,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_33,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_34,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_35,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_36,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_37,type,
esk11_2: ( $i * $i ) > $i ).
tff(decl_38,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_39,type,
esk13_1: $i > $i ).
tff(decl_40,type,
esk14_1: $i > $i ).
tff(decl_41,type,
esk15_1: $i > $i ).
tff(decl_42,type,
esk16_1: $i > $i ).
tff(decl_43,type,
esk17_1: $i > $i ).
tff(decl_44,type,
esk18_1: $i > $i ).
tff(decl_45,type,
esk19_1: $i > $i ).
tff(decl_46,type,
esk20_1: $i > $i ).
tff(decl_47,type,
esk21_1: $i > $i ).
fof(axiom_8,axiom,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_8) ).
fof(nonzerosexistid,conjecture,
? [X63] :
! [X46] :
( ~ id(X63,X46)
| ~ r1(X46) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonzerosexistid) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( id(X2,X1)
& r1(X2) )
| ( ~ r1(X2)
& ~ id(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_1) ).
fof(axiom_6,axiom,
! [X15,X16] :
( ~ id(X15,X16)
| id(X16,X15) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_6) ).
fof(axiom_7,axiom,
! [X17,X18,X19] :
( ~ id(X17,X18)
| id(X17,X19)
| ~ id(X18,X19) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_7) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_2) ).
fof(axiom_7a,axiom,
! [X65,X66] :
( ! [X67] :
( ~ id(X67,X66)
| ~ r1(X67) )
| ~ r2(X65,X66) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_7a) ).
fof(c_0_7,plain,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
inference(fof_simplification,[status(thm)],[axiom_8]) ).
fof(c_0_8,negated_conjecture,
~ ? [X63] :
! [X46] :
( ~ id(X63,X46)
| ~ r1(X46) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nonzerosexistid])]) ).
fof(c_0_9,plain,
? [X1] :
! [X2] :
( ( id(X2,X1)
& r1(X2) )
| ( ~ r1(X2)
& ~ id(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_10,plain,
! [X87,X88] :
( ( r1(X87)
| ~ r1(X87)
| ~ id(X87,X88) )
& ( r1(X88)
| ~ r1(X87)
| ~ id(X87,X88) )
& ( r1(X87)
| ~ r1(X88)
| ~ id(X87,X88) )
& ( r1(X88)
| ~ r1(X88)
| ~ id(X87,X88) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
fof(c_0_11,negated_conjecture,
! [X135] :
( id(X135,esk21_1(X135))
& r1(esk21_1(X135)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,plain,
! [X15,X16] :
( ~ id(X15,X16)
| id(X16,X15) ),
inference(fof_simplification,[status(thm)],[axiom_6]) ).
fof(c_0_13,plain,
! [X69] :
( ( ~ r1(X69)
| id(X69,esk1_0) )
& ( ~ id(X69,esk1_0)
| id(X69,esk1_0) )
& ( ~ r1(X69)
| r1(X69) )
& ( ~ id(X69,esk1_0)
| r1(X69) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])])]) ).
cnf(c_0_14,plain,
( r1(X1)
| ~ r1(X2)
| ~ id(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
id(X1,esk21_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
r1(esk21_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X17,X18,X19] :
( ~ id(X17,X18)
| id(X17,X19)
| ~ id(X18,X19) ),
inference(fof_simplification,[status(thm)],[axiom_7]) ).
fof(c_0_18,plain,
! [X82,X83] :
( ~ id(X82,X83)
| id(X83,X82) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( id(X1,esk1_0)
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
fof(c_0_21,plain,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_22,plain,
! [X84,X85,X86] :
( ~ id(X84,X85)
| id(X84,X86)
| ~ id(X85,X86) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( id(X2,X1)
| ~ id(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
id(X1,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
fof(c_0_25,plain,
! [X65,X66] :
( ! [X67] :
( ~ id(X67,X66)
| ~ r1(X67) )
| ~ r2(X65,X66) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
fof(c_0_26,plain,
! [X70,X72] :
( ( ~ r2(X70,X72)
| id(X72,esk2_1(X70)) )
& ( ~ id(X72,esk2_1(X70))
| id(X72,esk2_1(X70)) )
& ( ~ r2(X70,X72)
| r2(X70,X72) )
& ( ~ id(X72,esk2_1(X70))
| r2(X70,X72) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_21])])]) ).
cnf(c_0_27,plain,
( id(X1,X3)
| ~ id(X1,X2)
| ~ id(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
id(esk1_0,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_29,plain,
! [X132,X133,X134] :
( ~ id(X134,X133)
| ~ r1(X134)
| ~ r2(X132,X133) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_25])]) ).
cnf(c_0_30,plain,
( r2(X2,X1)
| ~ id(X1,esk2_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
id(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_24])]) ).
cnf(c_0_32,plain,
( ~ id(X1,X2)
| ~ r1(X1)
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
r2(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_34,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_20])]),c_0_33]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUN067+1 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.32 % Computer : n010.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Sun Aug 27 09:28:34 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.18/0.60 start to proof: theBenchmark
% 0.18/0.61 % Version : CSE_E---1.5
% 0.18/0.61 % Problem : theBenchmark.p
% 0.18/0.61 % Proof found
% 0.18/0.61 % SZS status Theorem for theBenchmark.p
% 0.18/0.61 % SZS output start Proof
% See solution above
% 0.18/0.62 % Total time : 0.009000 s
% 0.18/0.62 % SZS output end Proof
% 0.18/0.62 % Total time : 0.011000 s
%------------------------------------------------------------------------------