TSTP Solution File: PRO011+4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PRO011+4 : 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 : n014.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.21s 0.61s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 46
% Syntax : Number of formulae : 74 ( 6 unt; 40 typ; 0 def)
% Number of atoms : 171 ( 8 equ)
% Maximal formula atoms : 49 ( 5 avg)
% Number of connectives : 198 ( 61 ~; 77 |; 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 : 64 ( 34 >; 30 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 1 prp; 0-3 aty)
% Number of functors : 23 ( 23 usr; 6 con; 0-3 aty)
% Number of variables : 66 ( 5 sgn; 27 !; 14 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
occurrence_of: ( $i * $i ) > $o ).
tff(decl_23,type,
atomic: $i > $o ).
tff(decl_24,type,
root: ( $i * $i ) > $o ).
tff(decl_25,type,
subactivity_occurrence: ( $i * $i ) > $o ).
tff(decl_26,type,
root_occ: ( $i * $i ) > $o ).
tff(decl_27,type,
leaf_occ: ( $i * $i ) > $o ).
tff(decl_28,type,
min_precedes: ( $i * $i * $i ) > $o ).
tff(decl_29,type,
arboreal: $i > $o ).
tff(decl_30,type,
activity: $i > $o ).
tff(decl_31,type,
activity_occurrence: $i > $o ).
tff(decl_32,type,
subactivity: ( $i * $i ) > $o ).
tff(decl_33,type,
atocc: ( $i * $i ) > $o ).
tff(decl_34,type,
leaf: ( $i * $i ) > $o ).
tff(decl_35,type,
legal: $i > $o ).
tff(decl_36,type,
earlier: ( $i * $i ) > $o ).
tff(decl_37,type,
precedes: ( $i * $i ) > $o ).
tff(decl_38,type,
next_subocc: ( $i * $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_2: ( $i * $i ) > $i ).
tff(decl_45,type,
esk2_2: ( $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_1: $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_2: ( $i * $i ) > $i ).
tff(decl_52,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_53,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_54,type,
esk11_3: ( $i * $i * $i ) > $i ).
tff(decl_55,type,
esk12_3: ( $i * $i * $i ) > $i ).
tff(decl_56,type,
esk13_1: $i > $i ).
tff(decl_57,type,
esk14_1: $i > $i ).
tff(decl_58,type,
esk15_1: $i > $i ).
tff(decl_59,type,
esk16_0: $i ).
tff(decl_60,type,
esk17_2: ( $i * $i ) > $i ).
tff(decl_61,type,
esk18_2: ( $i * $i ) > $i ).
fof(goals,conjecture,
! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108] :
( leaf_occ(X108,X106)
& ( occurrence_of(X108,tptp1)
=> ~ ? [X109] :
( occurrence_of(X109,tptp2)
& subactivity_occurrence(X109,X106)
& min_precedes(X107,X109,tptp0) ) )
& ( occurrence_of(X108,tptp2)
=> ~ ? [X110] :
( occurrence_of(X110,tptp1)
& subactivity_occurrence(X110,X106)
& min_precedes(X107,X110,tptp0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_08,axiom,
! [X29,X30,X31] :
( ( occurrence_of(X29,X30)
& occurrence_of(X29,X31) )
=> X30 = X31 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).
fof(sos_32,axiom,
! [X102] :
( occurrence_of(X102,tptp0)
=> ? [X103,X104,X105] :
( occurrence_of(X103,tptp3)
& root_occ(X103,X102)
& occurrence_of(X104,tptp4)
& next_subocc(X103,X104,tptp0)
& ( occurrence_of(X105,tptp1)
| occurrence_of(X105,tptp2) )
& next_subocc(X104,X105,tptp0)
& leaf_occ(X105,X102) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(sos_18,axiom,
! [X56,X57] :
( leaf_occ(X56,X57)
<=> ? [X58] :
( occurrence_of(X57,X58)
& subactivity_occurrence(X56,X57)
& leaf(X56,X58) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_18) ).
fof(sos_15,axiom,
! [X48,X49] :
( leaf(X48,X49)
<=> ( ( root(X48,X49)
| ? [X50] : min_precedes(X50,X48,X49) )
& ~ ? [X51] : min_precedes(X48,X51,X49) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_15) ).
fof(sos_44,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_44) ).
fof(c_0_6,negated_conjecture,
~ ! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108] :
( leaf_occ(X108,X106)
& ( occurrence_of(X108,tptp1)
=> ~ ? [X109] :
( occurrence_of(X109,tptp2)
& subactivity_occurrence(X109,X106)
& min_precedes(X107,X109,tptp0) ) )
& ( occurrence_of(X108,tptp2)
=> ~ ? [X110] :
( occurrence_of(X110,tptp1)
& subactivity_occurrence(X110,X106)
& min_precedes(X107,X110,tptp0) ) ) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X139,X140,X141] :
( ~ occurrence_of(X139,X140)
| ~ occurrence_of(X139,X141)
| X140 = X141 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])]) ).
fof(c_0_8,negated_conjecture,
! [X234,X235] :
( occurrence_of(esk16_0,tptp0)
& ( occurrence_of(X235,tptp2)
| occurrence_of(X235,tptp1)
| ~ leaf_occ(X235,esk16_0) )
& ( occurrence_of(esk18_2(X234,X235),tptp1)
| occurrence_of(X235,tptp1)
| ~ leaf_occ(X235,esk16_0) )
& ( subactivity_occurrence(esk18_2(X234,X235),esk16_0)
| occurrence_of(X235,tptp1)
| ~ leaf_occ(X235,esk16_0) )
& ( min_precedes(X234,esk18_2(X234,X235),tptp0)
| occurrence_of(X235,tptp1)
| ~ leaf_occ(X235,esk16_0) )
& ( occurrence_of(X235,tptp2)
| occurrence_of(esk17_2(X234,X235),tptp2)
| ~ leaf_occ(X235,esk16_0) )
& ( occurrence_of(esk18_2(X234,X235),tptp1)
| occurrence_of(esk17_2(X234,X235),tptp2)
| ~ leaf_occ(X235,esk16_0) )
& ( subactivity_occurrence(esk18_2(X234,X235),esk16_0)
| occurrence_of(esk17_2(X234,X235),tptp2)
| ~ leaf_occ(X235,esk16_0) )
& ( min_precedes(X234,esk18_2(X234,X235),tptp0)
| occurrence_of(esk17_2(X234,X235),tptp2)
| ~ leaf_occ(X235,esk16_0) )
& ( occurrence_of(X235,tptp2)
| subactivity_occurrence(esk17_2(X234,X235),esk16_0)
| ~ leaf_occ(X235,esk16_0) )
& ( occurrence_of(esk18_2(X234,X235),tptp1)
| subactivity_occurrence(esk17_2(X234,X235),esk16_0)
| ~ leaf_occ(X235,esk16_0) )
& ( subactivity_occurrence(esk18_2(X234,X235),esk16_0)
| subactivity_occurrence(esk17_2(X234,X235),esk16_0)
| ~ leaf_occ(X235,esk16_0) )
& ( min_precedes(X234,esk18_2(X234,X235),tptp0)
| subactivity_occurrence(esk17_2(X234,X235),esk16_0)
| ~ leaf_occ(X235,esk16_0) )
& ( occurrence_of(X235,tptp2)
| min_precedes(X234,esk17_2(X234,X235),tptp0)
| ~ leaf_occ(X235,esk16_0) )
& ( occurrence_of(esk18_2(X234,X235),tptp1)
| min_precedes(X234,esk17_2(X234,X235),tptp0)
| ~ leaf_occ(X235,esk16_0) )
& ( subactivity_occurrence(esk18_2(X234,X235),esk16_0)
| min_precedes(X234,esk17_2(X234,X235),tptp0)
| ~ leaf_occ(X235,esk16_0) )
& ( min_precedes(X234,esk18_2(X234,X235),tptp0)
| min_precedes(X234,esk17_2(X234,X235),tptp0)
| ~ leaf_occ(X235,esk16_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,
! [X229] :
( ( occurrence_of(esk13_1(X229),tptp3)
| ~ occurrence_of(X229,tptp0) )
& ( root_occ(esk13_1(X229),X229)
| ~ occurrence_of(X229,tptp0) )
& ( occurrence_of(esk14_1(X229),tptp4)
| ~ occurrence_of(X229,tptp0) )
& ( next_subocc(esk13_1(X229),esk14_1(X229),tptp0)
| ~ occurrence_of(X229,tptp0) )
& ( occurrence_of(esk15_1(X229),tptp1)
| occurrence_of(esk15_1(X229),tptp2)
| ~ occurrence_of(X229,tptp0) )
& ( next_subocc(esk14_1(X229),esk15_1(X229),tptp0)
| ~ occurrence_of(X229,tptp0) )
& ( leaf_occ(esk15_1(X229),X229)
| ~ occurrence_of(X229,tptp0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_32])])])]) ).
cnf(c_0_10,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
occurrence_of(esk16_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X173,X174,X176,X177,X178] :
( ( occurrence_of(X174,esk9_2(X173,X174))
| ~ leaf_occ(X173,X174) )
& ( subactivity_occurrence(X173,X174)
| ~ leaf_occ(X173,X174) )
& ( leaf(X173,esk9_2(X173,X174))
| ~ leaf_occ(X173,X174) )
& ( ~ occurrence_of(X177,X178)
| ~ subactivity_occurrence(X176,X177)
| ~ leaf(X176,X178)
| leaf_occ(X176,X177) ) ),
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_18])])])])])]) ).
fof(c_0_13,plain,
! [X161,X162,X164,X165,X166,X167] :
( ( root(X161,X162)
| min_precedes(esk7_2(X161,X162),X161,X162)
| ~ leaf(X161,X162) )
& ( ~ min_precedes(X161,X164,X162)
| ~ leaf(X161,X162) )
& ( ~ root(X165,X166)
| min_precedes(X165,esk8_2(X165,X166),X166)
| leaf(X165,X166) )
& ( ~ min_precedes(X167,X165,X166)
| min_precedes(X165,esk8_2(X165,X166),X166)
| leaf(X165,X166) ) ),
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_15])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( min_precedes(X1,esk18_2(X1,X2),tptp0)
| occurrence_of(X2,tptp1)
| ~ leaf_occ(X2,esk16_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( leaf_occ(esk15_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk16_0,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
( occurrence_of(X1,esk9_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ~ min_precedes(X1,X2,X3)
| ~ leaf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( min_precedes(X1,esk18_2(X1,esk15_1(esk16_0)),tptp0)
| occurrence_of(esk15_1(esk16_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11])]) ).
cnf(c_0_20,plain,
( leaf(X1,esk9_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
( esk9_2(X1,esk16_0) = tptp0
| ~ leaf_occ(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk17_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk16_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( occurrence_of(esk15_1(esk16_0),tptp1)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( leaf(X1,tptp0)
| ~ leaf_occ(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( min_precedes(X1,esk17_2(X1,esk15_1(esk16_0)),tptp0)
| occurrence_of(esk15_1(esk16_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_11])]) ).
cnf(c_0_26,negated_conjecture,
( occurrence_of(esk15_1(esk16_0),tptp1)
| ~ leaf_occ(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( occurrence_of(esk15_1(esk16_0),tptp2)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
occurrence_of(esk15_1(esk16_0),tptp1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_11])]) ).
cnf(c_0_29,negated_conjecture,
( occurrence_of(esk15_1(esk16_0),tptp2)
| ~ leaf_occ(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( X1 = tptp1
| ~ occurrence_of(esk15_1(esk16_0),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
occurrence_of(esk15_1(esk16_0),tptp2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_11])]) ).
cnf(c_0_32,plain,
tptp1 != tptp2,
inference(split_conjunct,[status(thm)],[sos_44]) ).
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.00/0.12 % Problem : PRO011+4 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n014.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:26:15 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.61 % Version : CSE_E---1.5
% 0.21/0.61 % Problem : theBenchmark.p
% 0.21/0.61 % Proof found
% 0.21/0.61 % SZS status Theorem for theBenchmark.p
% 0.21/0.61 % SZS output start Proof
% See solution above
% 0.21/0.62 % Total time : 0.029000 s
% 0.21/0.62 % SZS output end Proof
% 0.21/0.62 % Total time : 0.033000 s
%------------------------------------------------------------------------------