TSTP Solution File: PRO010+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PRO010+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n009.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 : Tue Aug 22 10:53:45 EDT 2023
% Result : Theorem 5.28s 2.30s
% Output : CNFRefutation 5.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 48
% Syntax : Number of formulae : 91 ( 18 unt; 40 typ; 0 def)
% Number of atoms : 112 ( 16 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 104 ( 43 ~; 36 |; 16 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 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 : 62 (; 51 !; 11 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ next_subocc > min_precedes > subactivity_occurrence > subactivity > root_occ > root > precedes > occurrence_of > leaf_occ > leaf > earlier > atocc > legal > atomic > arboreal > activity_occurrence > activity > #nlpp > tptp4 > tptp3 > tptp2 > tptp1 > tptp0 > #skF_5 > #skF_6 > #skF_17 > #skF_12 > #skF_16 > #skF_15 > #skF_18 > #skF_10 > #skF_8 > #skF_11 > #skF_13 > #skF_3 > #skF_14 > #skF_2 > #skF_7 > #skF_1 > #skF_9 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(arboreal,type,
arboreal: $i > $o ).
tff(tptp1,type,
tptp1: $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff(subactivity,type,
subactivity: ( $i * $i ) > $o ).
tff(root,type,
root: ( $i * $i ) > $o ).
tff('#skF_17',type,
'#skF_17': ( $i * $i ) > $i ).
tff(tptp2,type,
tptp2: $i ).
tff(leaf,type,
leaf: ( $i * $i ) > $o ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff(tptp0,type,
tptp0: $i ).
tff(root_occ,type,
root_occ: ( $i * $i ) > $o ).
tff(tptp3,type,
tptp3: $i ).
tff(occurrence_of,type,
occurrence_of: ( $i * $i ) > $o ).
tff(atomic,type,
atomic: $i > $o ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(tptp4,type,
tptp4: $i ).
tff('#skF_15',type,
'#skF_15': $i > $i ).
tff(legal,type,
legal: $i > $o ).
tff('#skF_18',type,
'#skF_18': ( $i * $i ) > $i ).
tff(earlier,type,
earlier: ( $i * $i ) > $o ).
tff(activity_occurrence,type,
activity_occurrence: $i > $o ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i ) > $i ).
tff(leaf_occ,type,
leaf_occ: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff(activity,type,
activity: $i > $o ).
tff(min_precedes,type,
min_precedes: ( $i * $i * $i ) > $o ).
tff(precedes,type,
precedes: ( $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(subactivity_occurrence,type,
subactivity_occurrence: ( $i * $i ) > $o ).
tff(next_subocc,type,
next_subocc: ( $i * $i * $i ) > $o ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff(atocc,type,
atocc: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_319,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_44) ).
tff(f_341,negated_conjecture,
~ ! [X105] :
( occurrence_of(X105,tptp0)
=> ? [X106,X107] :
( leaf_occ(X107,X105)
& ( occurrence_of(X107,tptp1)
=> ~ ? [X108] :
( occurrence_of(X108,tptp2)
& min_precedes(X106,X108,tptp0) ) )
& ( occurrence_of(X107,tptp2)
=> ~ ? [X109] :
( occurrence_of(X109,tptp1)
& min_precedes(X106,X109,tptp0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(f_300,axiom,
! [X101] :
( occurrence_of(X101,tptp0)
=> ? [X102,X103,X104] :
( occurrence_of(X102,tptp3)
& root_occ(X102,X101)
& occurrence_of(X103,tptp4)
& next_subocc(X102,X103,tptp0)
& ( occurrence_of(X104,tptp1)
| occurrence_of(X104,tptp2) )
& next_subocc(X103,X104,tptp0)
& leaf_occ(X104,X101) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
tff(f_188,axiom,
! [X55,X56] :
( leaf_occ(X55,X56)
<=> ? [X57] :
( occurrence_of(X56,X57)
& subactivity_occurrence(X55,X56)
& leaf(X55,X57) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_18) ).
tff(f_116,axiom,
! [X28,X29,X30] :
( ( occurrence_of(X28,X29)
& occurrence_of(X28,X30) )
=> ( X29 = X30 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).
tff(f_169,axiom,
! [X47,X48] :
( leaf(X47,X48)
<=> ( ( root(X47,X48)
| ? [X49] : min_precedes(X49,X47,X48) )
& ~ ? [X50] : min_precedes(X47,X50,X48) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_15) ).
tff(f_138,axiom,
! [X39,X40] :
( subactivity_occurrence(X39,X40)
=> ( activity_occurrence(X39)
& activity_occurrence(X40) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_11) ).
tff(f_145,axiom,
! [X41] :
( activity_occurrence(X41)
=> ? [X42] :
( activity(X42)
& occurrence_of(X41,X42) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_12) ).
tff(c_158,plain,
tptp2 != tptp1,
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_160,plain,
occurrence_of('#skF_16',tptp0),
inference(cnfTransformation,[status(thm)],[f_341]) ).
tff(c_122,plain,
! [X101_116] :
( leaf_occ('#skF_15'(X101_116),X101_116)
| ~ occurrence_of(X101_116,tptp0) ),
inference(cnfTransformation,[status(thm)],[f_300]) ).
tff(c_74,plain,
! [X56_65,X55_64] :
( occurrence_of(X56_65,'#skF_9'(X55_64,X56_65))
| ~ leaf_occ(X55_64,X56_65) ),
inference(cnfTransformation,[status(thm)],[f_188]) ).
tff(c_453,plain,
! [X30_208,X29_209,X28_210] :
( ( X30_208 = X29_209 )
| ~ occurrence_of(X28_210,X30_208)
| ~ occurrence_of(X28_210,X29_209) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_482,plain,
! [X29_213] :
( ( tptp0 = X29_213 )
| ~ occurrence_of('#skF_16',X29_213) ),
inference(resolution,[status(thm)],[c_160,c_453]) ).
tff(c_560,plain,
! [X55_218] :
( ( '#skF_9'(X55_218,'#skF_16') = tptp0 )
| ~ leaf_occ(X55_218,'#skF_16') ),
inference(resolution,[status(thm)],[c_74,c_482]) ).
tff(c_564,plain,
( ( '#skF_9'('#skF_15'('#skF_16'),'#skF_16') = tptp0 )
| ~ occurrence_of('#skF_16',tptp0) ),
inference(resolution,[status(thm)],[c_122,c_560]) ).
tff(c_567,plain,
'#skF_9'('#skF_15'('#skF_16'),'#skF_16') = tptp0,
inference(demodulation,[status(thm),theory(equality)],[c_160,c_564]) ).
tff(c_641,plain,
! [X55_229,X56_230] :
( leaf(X55_229,'#skF_9'(X55_229,X56_230))
| ~ leaf_occ(X55_229,X56_230) ),
inference(cnfTransformation,[status(thm)],[f_188]) ).
tff(c_644,plain,
( leaf('#skF_15'('#skF_16'),tptp0)
| ~ leaf_occ('#skF_15'('#skF_16'),'#skF_16') ),
inference(superposition,[status(thm),theory(equality)],[c_567,c_641]) ).
tff(c_877,plain,
~ leaf_occ('#skF_15'('#skF_16'),'#skF_16'),
inference(splitLeft,[status(thm)],[c_644]) ).
tff(c_882,plain,
~ occurrence_of('#skF_16',tptp0),
inference(resolution,[status(thm)],[c_122,c_877]) ).
tff(c_886,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_160,c_882]) ).
tff(c_888,plain,
leaf_occ('#skF_15'('#skF_16'),'#skF_16'),
inference(splitRight,[status(thm)],[c_644]) ).
tff(c_320,plain,
! [X106_190,X107_191] :
( min_precedes(X106_190,'#skF_17'(X106_190,X107_191),tptp0)
| occurrence_of(X107_191,tptp2)
| ~ leaf_occ(X107_191,'#skF_16') ),
inference(cnfTransformation,[status(thm)],[f_341]) ).
tff(c_54,plain,
! [X47_52,X50_59,X48_53] :
( ~ min_precedes(X47_52,X50_59,X48_53)
| ~ leaf(X47_52,X48_53) ),
inference(cnfTransformation,[status(thm)],[f_169]) ).
tff(c_332,plain,
! [X106_190,X107_191] :
( ~ leaf(X106_190,tptp0)
| occurrence_of(X107_191,tptp2)
| ~ leaf_occ(X107_191,'#skF_16') ),
inference(resolution,[status(thm)],[c_320,c_54]) ).
tff(c_954,plain,
! [X106_190] : ~ leaf(X106_190,tptp0),
inference(splitLeft,[status(thm)],[c_332]) ).
tff(c_887,plain,
leaf('#skF_15'('#skF_16'),tptp0),
inference(splitRight,[status(thm)],[c_644]) ).
tff(c_956,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_954,c_887]) ).
tff(c_957,plain,
! [X107_191] :
( occurrence_of(X107_191,tptp2)
| ~ leaf_occ(X107_191,'#skF_16') ),
inference(splitRight,[status(thm)],[c_332]) ).
tff(c_238,plain,
! [X55_164,X56_165] :
( subactivity_occurrence(X55_164,X56_165)
| ~ leaf_occ(X55_164,X56_165) ),
inference(cnfTransformation,[status(thm)],[f_188]) ).
tff(c_38,plain,
! [X39_42,X40_43] :
( activity_occurrence(X39_42)
| ~ subactivity_occurrence(X39_42,X40_43) ),
inference(cnfTransformation,[status(thm)],[f_138]) ).
tff(c_246,plain,
! [X55_164,X56_165] :
( activity_occurrence(X55_164)
| ~ leaf_occ(X55_164,X56_165) ),
inference(resolution,[status(thm)],[c_238,c_38]) ).
tff(c_905,plain,
activity_occurrence('#skF_15'('#skF_16')),
inference(resolution,[status(thm)],[c_888,c_246]) ).
tff(c_399,plain,
! [X107_198,X106_199] :
( occurrence_of(X107_198,tptp1)
| min_precedes(X106_199,'#skF_18'(X106_199,X107_198),tptp0)
| ~ leaf_occ(X107_198,'#skF_16') ),
inference(cnfTransformation,[status(thm)],[f_341]) ).
tff(c_411,plain,
! [X106_199,X107_198] :
( ~ leaf(X106_199,tptp0)
| occurrence_of(X107_198,tptp1)
| ~ leaf_occ(X107_198,'#skF_16') ),
inference(resolution,[status(thm)],[c_399,c_54]) ).
tff(c_917,plain,
! [X106_199] : ~ leaf(X106_199,tptp0),
inference(splitLeft,[status(thm)],[c_411]) ).
tff(c_919,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_917,c_887]) ).
tff(c_921,plain,
! [X107_265] :
( occurrence_of(X107_265,tptp1)
| ~ leaf_occ(X107_265,'#skF_16') ),
inference(splitRight,[status(thm)],[c_411]) ).
tff(c_40,plain,
! [X41_44] :
( occurrence_of(X41_44,'#skF_5'(X41_44))
| ~ activity_occurrence(X41_44) ),
inference(cnfTransformation,[status(thm)],[f_145]) ).
tff(c_478,plain,
! [X29_209,X41_44] :
( ( X29_209 = '#skF_5'(X41_44) )
| ~ occurrence_of(X41_44,X29_209)
| ~ activity_occurrence(X41_44) ),
inference(resolution,[status(thm)],[c_40,c_453]) ).
tff(c_991,plain,
! [X107_267] :
( ( '#skF_5'(X107_267) = tptp1 )
| ~ activity_occurrence(X107_267)
| ~ leaf_occ(X107_267,'#skF_16') ),
inference(resolution,[status(thm)],[c_921,c_478]) ).
tff(c_994,plain,
( ( '#skF_5'('#skF_15'('#skF_16')) = tptp1 )
| ~ activity_occurrence('#skF_15'('#skF_16')) ),
inference(resolution,[status(thm)],[c_888,c_991]) ).
tff(c_1001,plain,
'#skF_5'('#skF_15'('#skF_16')) = tptp1,
inference(demodulation,[status(thm),theory(equality)],[c_905,c_994]) ).
tff(c_1014,plain,
( occurrence_of('#skF_15'('#skF_16'),tptp1)
| ~ activity_occurrence('#skF_15'('#skF_16')) ),
inference(superposition,[status(thm),theory(equality)],[c_1001,c_40]) ).
tff(c_1025,plain,
occurrence_of('#skF_15'('#skF_16'),tptp1),
inference(demodulation,[status(thm),theory(equality)],[c_905,c_1014]) ).
tff(c_30,plain,
! [X30_31,X29_30,X28_29] :
( ( X30_31 = X29_30 )
| ~ occurrence_of(X28_29,X30_31)
| ~ occurrence_of(X28_29,X29_30) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_1070,plain,
! [X29_270] :
( ( tptp1 = X29_270 )
| ~ occurrence_of('#skF_15'('#skF_16'),X29_270) ),
inference(resolution,[status(thm)],[c_1025,c_30]) ).
tff(c_1077,plain,
( ( tptp2 = tptp1 )
| ~ leaf_occ('#skF_15'('#skF_16'),'#skF_16') ),
inference(resolution,[status(thm)],[c_957,c_1070]) ).
tff(c_1102,plain,
tptp2 = tptp1,
inference(demodulation,[status(thm),theory(equality)],[c_888,c_1077]) ).
tff(c_1104,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_158,c_1102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PRO010+4 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 21:44:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 5.28/2.30 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.28/2.31
% 5.28/2.31 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.64/2.35
% 5.64/2.35 Inference rules
% 5.64/2.35 ----------------------
% 5.64/2.35 #Ref : 0
% 5.64/2.35 #Sup : 187
% 5.64/2.35 #Fact : 0
% 5.64/2.35 #Define : 0
% 5.64/2.35 #Split : 11
% 5.64/2.35 #Chain : 0
% 5.64/2.35 #Close : 0
% 5.64/2.35
% 5.64/2.35 Ordering : KBO
% 5.64/2.35
% 5.64/2.35 Simplification rules
% 5.64/2.35 ----------------------
% 5.64/2.35 #Subsume : 39
% 5.64/2.35 #Demod : 69
% 5.64/2.35 #Tautology : 51
% 5.64/2.35 #SimpNegUnit : 9
% 5.64/2.35 #BackRed : 4
% 5.64/2.35
% 5.64/2.35 #Partial instantiations: 0
% 5.64/2.35 #Strategies tried : 1
% 5.64/2.35
% 5.64/2.35 Timing (in seconds)
% 5.64/2.35 ----------------------
% 5.64/2.35 Preprocessing : 0.63
% 5.64/2.35 Parsing : 0.32
% 5.64/2.35 CNF conversion : 0.06
% 5.64/2.35 Main loop : 0.60
% 5.64/2.35 Inferencing : 0.22
% 5.64/2.35 Reduction : 0.17
% 5.64/2.35 Demodulation : 0.11
% 5.64/2.35 BG Simplification : 0.04
% 5.64/2.35 Subsumption : 0.13
% 5.64/2.35 Abstraction : 0.02
% 5.64/2.35 MUC search : 0.00
% 5.64/2.35 Cooper : 0.00
% 5.64/2.35 Total : 1.29
% 5.64/2.35 Index Insertion : 0.00
% 5.64/2.35 Index Deletion : 0.00
% 5.64/2.35 Index Matching : 0.00
% 5.64/2.35 BG Taut test : 0.00
%------------------------------------------------------------------------------