TSTP Solution File: PRO011+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PRO011+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n021.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 13:06:06 EDT 2023
% Result : Theorem 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 49
% Syntax : Number of formulae : 77 ( 10 unt; 43 typ; 0 def)
% Number of atoms : 167 ( 8 equ)
% Maximal formula atoms : 49 ( 4 avg)
% Number of connectives : 190 ( 57 ~; 73 |; 50 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 74 ( 37 >; 37 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 1 prp; 0-3 aty)
% Number of functors : 26 ( 26 usr; 6 con; 0-4 aty)
% Number of variables : 62 ( 3 sgn; 27 !; 14 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
occurrence_of: ( $i * $i ) > $o ).
tff(decl_23,type,
activity: $i > $o ).
tff(decl_24,type,
activity_occurrence: $i > $o ).
tff(decl_25,type,
subactivity: ( $i * $i ) > $o ).
tff(decl_26,type,
earlier: ( $i * $i ) > $o ).
tff(decl_27,type,
arboreal: $i > $o ).
tff(decl_28,type,
atomic: $i > $o ).
tff(decl_29,type,
legal: $i > $o ).
tff(decl_30,type,
precedes: ( $i * $i ) > $o ).
tff(decl_31,type,
min_precedes: ( $i * $i * $i ) > $o ).
tff(decl_32,type,
atocc: ( $i * $i ) > $o ).
tff(decl_33,type,
root: ( $i * $i ) > $o ).
tff(decl_34,type,
leaf: ( $i * $i ) > $o ).
tff(decl_35,type,
next_subocc: ( $i * $i * $i ) > $o ).
tff(decl_36,type,
subactivity_occurrence: ( $i * $i ) > $o ).
tff(decl_37,type,
root_occ: ( $i * $i ) > $o ).
tff(decl_38,type,
leaf_occ: ( $i * $i ) > $o ).
tff(decl_39,type,
tptp0: $i ).
tff(decl_40,type,
tptp3: $i ).
tff(decl_41,type,
tptp4: $i ).
tff(decl_42,type,
tptp1: $i ).
tff(decl_43,type,
tptp2: $i ).
tff(decl_44,type,
esk1_1: $i > $i ).
tff(decl_45,type,
esk2_3: ( $i * $i * $i ) > $i ).
tff(decl_46,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_47,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_48,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_49,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_50,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_51,type,
esk8_3: ( $i * $i * $i ) > $i ).
tff(decl_52,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_53,type,
esk10_3: ( $i * $i * $i ) > $i ).
tff(decl_54,type,
esk11_2: ( $i * $i ) > $i ).
tff(decl_55,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_56,type,
esk13_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_57,type,
esk14_2: ( $i * $i ) > $i ).
tff(decl_58,type,
esk15_2: ( $i * $i ) > $i ).
tff(decl_59,type,
esk16_1: $i > $i ).
tff(decl_60,type,
esk17_1: $i > $i ).
tff(decl_61,type,
esk18_1: $i > $i ).
tff(decl_62,type,
esk19_0: $i ).
tff(decl_63,type,
esk20_2: ( $i * $i ) > $i ).
tff(decl_64,type,
esk21_2: ( $i * $i ) > $i ).
fof(goals,conjecture,
! [X110] :
( occurrence_of(X110,tptp0)
=> ? [X111,X112] :
( leaf_occ(X112,X110)
& ( occurrence_of(X112,tptp1)
=> ~ ? [X113] :
( occurrence_of(X113,tptp2)
& subactivity_occurrence(X113,X110)
& min_precedes(X111,X113,tptp0) ) )
& ( occurrence_of(X112,tptp2)
=> ~ ? [X114] :
( occurrence_of(X114,tptp1)
& subactivity_occurrence(X114,X110)
& min_precedes(X111,X114,tptp0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_35,axiom,
! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108,X109] :
( occurrence_of(X107,tptp3)
& root_occ(X107,X106)
& occurrence_of(X108,tptp4)
& next_subocc(X107,X108,tptp0)
& ( occurrence_of(X109,tptp1)
| occurrence_of(X109,tptp2) )
& next_subocc(X108,X109,tptp0)
& leaf_occ(X109,X106) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_35) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X6)
& occurrence_of(X5,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(sos_34,axiom,
! [X103,X104] :
( leaf_occ(X103,X104)
<=> ? [X105] :
( occurrence_of(X104,X105)
& subactivity_occurrence(X103,X104)
& leaf(X103,X105) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_34) ).
fof(sos_21,axiom,
! [X57,X58] :
( leaf(X57,X58)
<=> ( ( root(X57,X58)
| ? [X59] : min_precedes(X59,X57,X58) )
& ~ ? [X60] : min_precedes(X57,X60,X58) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_21) ).
fof(sos_47,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_47) ).
fof(c_0_6,negated_conjecture,
~ ! [X110] :
( occurrence_of(X110,tptp0)
=> ? [X111,X112] :
( leaf_occ(X112,X110)
& ( occurrence_of(X112,tptp1)
=> ~ ? [X113] :
( occurrence_of(X113,tptp2)
& subactivity_occurrence(X113,X110)
& min_precedes(X111,X113,tptp0) ) )
& ( occurrence_of(X112,tptp2)
=> ~ ? [X114] :
( occurrence_of(X114,tptp1)
& subactivity_occurrence(X114,X110)
& min_precedes(X111,X114,tptp0) ) ) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X237] :
( ( occurrence_of(esk16_1(X237),tptp3)
| ~ occurrence_of(X237,tptp0) )
& ( root_occ(esk16_1(X237),X237)
| ~ occurrence_of(X237,tptp0) )
& ( occurrence_of(esk17_1(X237),tptp4)
| ~ occurrence_of(X237,tptp0) )
& ( next_subocc(esk16_1(X237),esk17_1(X237),tptp0)
| ~ occurrence_of(X237,tptp0) )
& ( occurrence_of(esk18_1(X237),tptp1)
| occurrence_of(esk18_1(X237),tptp2)
| ~ occurrence_of(X237,tptp0) )
& ( next_subocc(esk17_1(X237),esk18_1(X237),tptp0)
| ~ occurrence_of(X237,tptp0) )
& ( leaf_occ(esk18_1(X237),X237)
| ~ occurrence_of(X237,tptp0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_35])])])]) ).
fof(c_0_8,negated_conjecture,
! [X242,X243] :
( occurrence_of(esk19_0,tptp0)
& ( occurrence_of(X243,tptp2)
| occurrence_of(X243,tptp1)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(esk21_2(X242,X243),tptp1)
| occurrence_of(X243,tptp1)
| ~ leaf_occ(X243,esk19_0) )
& ( subactivity_occurrence(esk21_2(X242,X243),esk19_0)
| occurrence_of(X243,tptp1)
| ~ leaf_occ(X243,esk19_0) )
& ( min_precedes(X242,esk21_2(X242,X243),tptp0)
| occurrence_of(X243,tptp1)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(X243,tptp2)
| occurrence_of(esk20_2(X242,X243),tptp2)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(esk21_2(X242,X243),tptp1)
| occurrence_of(esk20_2(X242,X243),tptp2)
| ~ leaf_occ(X243,esk19_0) )
& ( subactivity_occurrence(esk21_2(X242,X243),esk19_0)
| occurrence_of(esk20_2(X242,X243),tptp2)
| ~ leaf_occ(X243,esk19_0) )
& ( min_precedes(X242,esk21_2(X242,X243),tptp0)
| occurrence_of(esk20_2(X242,X243),tptp2)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(X243,tptp2)
| subactivity_occurrence(esk20_2(X242,X243),esk19_0)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(esk21_2(X242,X243),tptp1)
| subactivity_occurrence(esk20_2(X242,X243),esk19_0)
| ~ leaf_occ(X243,esk19_0) )
& ( subactivity_occurrence(esk21_2(X242,X243),esk19_0)
| subactivity_occurrence(esk20_2(X242,X243),esk19_0)
| ~ leaf_occ(X243,esk19_0) )
& ( min_precedes(X242,esk21_2(X242,X243),tptp0)
| subactivity_occurrence(esk20_2(X242,X243),esk19_0)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(X243,tptp2)
| min_precedes(X242,esk20_2(X242,X243),tptp0)
| ~ leaf_occ(X243,esk19_0) )
& ( occurrence_of(esk21_2(X242,X243),tptp1)
| min_precedes(X242,esk20_2(X242,X243),tptp0)
| ~ leaf_occ(X243,esk19_0) )
& ( subactivity_occurrence(esk21_2(X242,X243),esk19_0)
| min_precedes(X242,esk20_2(X242,X243),tptp0)
| ~ leaf_occ(X243,esk19_0) )
& ( min_precedes(X242,esk21_2(X242,X243),tptp0)
| min_precedes(X242,esk20_2(X242,X243),tptp0)
| ~ leaf_occ(X243,esk19_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_9,plain,
! [X119,X120,X121] :
( ~ occurrence_of(X119,X120)
| ~ occurrence_of(X119,X121)
| X120 = X121 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])]) ).
fof(c_0_10,plain,
! [X231,X232,X234,X235,X236] :
( ( occurrence_of(X232,esk15_2(X231,X232))
| ~ leaf_occ(X231,X232) )
& ( subactivity_occurrence(X231,X232)
| ~ leaf_occ(X231,X232) )
& ( leaf(X231,esk15_2(X231,X232))
| ~ leaf_occ(X231,X232) )
& ( ~ occurrence_of(X235,X236)
| ~ subactivity_occurrence(X234,X235)
| ~ leaf(X234,X236)
| leaf_occ(X234,X235) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_34])])])])])]) ).
cnf(c_0_11,plain,
( leaf_occ(esk18_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
occurrence_of(esk19_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( occurrence_of(X1,esk15_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
leaf_occ(esk18_1(esk19_0),esk19_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,plain,
! [X171,X172,X174,X175,X176,X177] :
( ( root(X171,X172)
| min_precedes(esk6_2(X171,X172),X171,X172)
| ~ leaf(X171,X172) )
& ( ~ min_precedes(X171,X174,X172)
| ~ leaf(X171,X172) )
& ( ~ root(X175,X176)
| min_precedes(X175,esk7_2(X175,X176),X176)
| leaf(X175,X176) )
& ( ~ min_precedes(X177,X175,X176)
| min_precedes(X175,esk7_2(X175,X176),X176)
| leaf(X175,X176) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])])])]) ).
cnf(c_0_17,negated_conjecture,
( min_precedes(X1,esk21_2(X1,X2),tptp0)
| occurrence_of(X2,tptp1)
| ~ leaf_occ(X2,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk19_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
occurrence_of(esk19_0,esk15_2(esk18_1(esk19_0),esk19_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ min_precedes(X1,X2,X3)
| ~ leaf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( min_precedes(X1,esk21_2(X1,esk18_1(esk19_0)),tptp0)
| occurrence_of(esk18_1(esk19_0),tptp1) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_22,plain,
( leaf(X1,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
esk15_2(esk18_1(esk19_0),esk19_0) = tptp0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk20_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp1)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
leaf(esk18_1(esk19_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( min_precedes(X1,esk20_2(X1,esk18_1(esk19_0)),tptp0)
| occurrence_of(esk18_1(esk19_0),tptp2) ),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_28,negated_conjecture,
occurrence_of(esk18_1(esk19_0),tptp1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp2)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( X1 = tptp1
| ~ occurrence_of(esk18_1(esk19_0),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
occurrence_of(esk18_1(esk19_0),tptp2),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_32,plain,
tptp1 != tptp2,
inference(split_conjunct,[status(thm)],[sos_47]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PRO011+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 19:10:58 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.61 % Total time : 0.023000 s
% 0.20/0.61 % SZS output end Proof
% 0.20/0.61 % Total time : 0.027000 s
%------------------------------------------------------------------------------