TSTP Solution File: SWC102+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC102+1 : TPTP v8.1.2. Released v2.4.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 : 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 : Tue Aug 22 11:01:10 EDT 2023
% Result : Theorem 6.42s 2.46s
% Output : CNFRefutation 6.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 77
% Syntax : Number of formulae : 89 ( 10 unt; 75 typ; 0 def)
% Number of atoms : 26 ( 7 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 22 ( 10 ~; 6 |; 1 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 85 ( 68 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 56 ( 56 usr; 7 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ segmentP > rearsegP > neq > memberP > lt > leq > gt > geq > frontsegP > totalorderedP > totalorderP > strictorderedP > strictorderP > ssList > ssItem > singletonP > equalelemsP > duplicatefreeP > cyclefreeP > cons > app > #nlpp > tl > hd > nil > #skF_36 > #skF_25 > #skF_5 > #skF_44 > #skF_21 > #skF_16 > #skF_6 > #skF_49 > #skF_18 > #skF_24 > #skF_35 > #skF_19 > #skF_31 > #skF_22 > #skF_37 > #skF_40 > #skF_48 > #skF_3 > #skF_34 > #skF_29 > #skF_15 > #skF_32 > #skF_51 > #skF_28 > #skF_10 > #skF_41 > #skF_2 > #skF_38 > #skF_43 > #skF_1 > #skF_8 > #skF_39 > #skF_23 > #skF_33 > #skF_26 > #skF_50 > #skF_13 > #skF_17 > #skF_11 > #skF_14 > #skF_27 > #skF_12 > #skF_7 > #skF_46 > #skF_42 > #skF_45 > #skF_9 > #skF_30 > #skF_4 > #skF_20 > #skF_47
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_36',type,
'#skF_36': $i > $i ).
tff(segmentP,type,
segmentP: ( $i * $i ) > $o ).
tff('#skF_25',type,
'#skF_25': $i > $i ).
tff(totalorderedP,type,
totalorderedP: $i > $o ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(equalelemsP,type,
equalelemsP: $i > $o ).
tff('#skF_44',type,
'#skF_44': $i > $i ).
tff('#skF_21',type,
'#skF_21': $i > $i ).
tff('#skF_16',type,
'#skF_16': $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_49',type,
'#skF_49': $i ).
tff('#skF_18',type,
'#skF_18': $i > $i ).
tff('#skF_24',type,
'#skF_24': $i > $i ).
tff('#skF_35',type,
'#skF_35': $i > $i ).
tff(singletonP,type,
singletonP: $i > $o ).
tff('#skF_19',type,
'#skF_19': $i > $i ).
tff('#skF_31',type,
'#skF_31': $i > $i ).
tff('#skF_22',type,
'#skF_22': $i > $i ).
tff(frontsegP,type,
frontsegP: ( $i * $i ) > $o ).
tff('#skF_37',type,
'#skF_37': $i > $i ).
tff(totalorderP,type,
totalorderP: $i > $o ).
tff(ssItem,type,
ssItem: $i > $o ).
tff('#skF_40',type,
'#skF_40': $i > $i ).
tff('#skF_48',type,
'#skF_48': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': $i > $i ).
tff('#skF_29',type,
'#skF_29': $i > $i ).
tff('#skF_15',type,
'#skF_15': $i > $i ).
tff('#skF_32',type,
'#skF_32': $i > $i ).
tff('#skF_51',type,
'#skF_51': $i ).
tff('#skF_28',type,
'#skF_28': $i > $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff('#skF_41',type,
'#skF_41': $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_38',type,
'#skF_38': $i > $i ).
tff('#skF_43',type,
'#skF_43': $i > $i ).
tff(hd,type,
hd: $i > $i ).
tff(app,type,
app: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(duplicatefreeP,type,
duplicatefreeP: $i > $o ).
tff(gt,type,
gt: ( $i * $i ) > $o ).
tff('#skF_39',type,
'#skF_39': $i > $i ).
tff('#skF_23',type,
'#skF_23': $i > $i ).
tff(rearsegP,type,
rearsegP: ( $i * $i ) > $o ).
tff('#skF_33',type,
'#skF_33': $i > $i ).
tff(memberP,type,
memberP: ( $i * $i ) > $o ).
tff('#skF_26',type,
'#skF_26': $i > $i ).
tff('#skF_50',type,
'#skF_50': $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff(ssList,type,
ssList: $i > $o ).
tff(cons,type,
cons: ( $i * $i ) > $i ).
tff(strictorderP,type,
strictorderP: $i > $o ).
tff('#skF_17',type,
'#skF_17': $i > $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff(lt,type,
lt: ( $i * $i ) > $o ).
tff(tl,type,
tl: $i > $i ).
tff(neq,type,
neq: ( $i * $i ) > $o ).
tff('#skF_27',type,
'#skF_27': $i > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_46',type,
'#skF_46': $i > $i ).
tff(nil,type,
nil: $i ).
tff('#skF_42',type,
'#skF_42': $i > $i ).
tff('#skF_45',type,
'#skF_45': $i > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(strictorderedP,type,
strictorderedP: $i > $o ).
tff('#skF_30',type,
'#skF_30': $i > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': $i > $i ).
tff(cyclefreeP,type,
cyclefreeP: $i > $o ).
tff('#skF_47',type,
'#skF_47': $i > $i ).
tff(f_1004,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ( X != W )
| ~ neq(V,nil)
| ( neq(U,nil)
& frontsegP(V,U) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f_548,axiom,
! [U] :
( ssList(U)
=> frontsegP(U,U) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax42) ).
tff(c_396,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1004]) ).
tff(c_431,plain,
! [U_1141] :
( frontsegP(U_1141,U_1141)
| ~ ssList(U_1141) ),
inference(cnfTransformation,[status(thm)],[f_548]) ).
tff(c_388,plain,
'#skF_51' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1004]) ).
tff(c_392,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1004]) ).
tff(c_406,plain,
'#skF_49' = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_388,c_392]) ).
tff(c_386,plain,
neq('#skF_49',nil),
inference(cnfTransformation,[status(thm)],[f_1004]) ).
tff(c_408,plain,
neq('#skF_50',nil),
inference(demodulation,[status(thm),theory(equality)],[c_406,c_386]) ).
tff(c_390,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1004]) ).
tff(c_384,plain,
( ~ frontsegP('#skF_49','#skF_48')
| ~ neq('#skF_48',nil) ),
inference(cnfTransformation,[status(thm)],[f_1004]) ).
tff(c_410,plain,
~ frontsegP('#skF_50','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_408,c_390,c_406,c_390,c_384]) ).
tff(c_434,plain,
~ ssList('#skF_50'),
inference(resolution,[status(thm)],[c_431,c_410]) ).
tff(c_438,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_396,c_434]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC102+1 : TPTP v8.1.2. Released v2.4.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 : n021.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:30:51 EDT 2023
% 0.13/0.35 % CPUTime :
% 6.42/2.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.42/2.46
% 6.42/2.46 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.42/2.49
% 6.42/2.49 Inference rules
% 6.42/2.49 ----------------------
% 6.42/2.49 #Ref : 0
% 6.42/2.49 #Sup : 7
% 6.42/2.49 #Fact : 0
% 6.42/2.49 #Define : 0
% 6.42/2.49 #Split : 0
% 6.42/2.49 #Chain : 0
% 6.42/2.49 #Close : 0
% 6.42/2.49
% 6.42/2.49 Ordering : KBO
% 6.42/2.49
% 6.42/2.49 Simplification rules
% 6.42/2.49 ----------------------
% 6.42/2.49 #Subsume : 8
% 6.42/2.49 #Demod : 13
% 6.42/2.49 #Tautology : 11
% 6.42/2.49 #SimpNegUnit : 0
% 6.42/2.49 #BackRed : 0
% 6.42/2.49
% 6.42/2.49 #Partial instantiations: 0
% 6.42/2.49 #Strategies tried : 1
% 6.42/2.49
% 6.42/2.49 Timing (in seconds)
% 6.42/2.49 ----------------------
% 6.42/2.50 Preprocessing : 1.00
% 6.42/2.50 Parsing : 0.42
% 6.42/2.50 CNF conversion : 0.14
% 6.42/2.50 Main loop : 0.40
% 6.42/2.50 Inferencing : 0.06
% 6.42/2.50 Reduction : 0.16
% 6.42/2.50 Demodulation : 0.12
% 6.42/2.50 BG Simplification : 0.08
% 6.42/2.50 Subsumption : 0.11
% 6.79/2.50 Abstraction : 0.02
% 6.79/2.50 MUC search : 0.00
% 6.79/2.50 Cooper : 0.00
% 6.79/2.50 Total : 1.45
% 6.79/2.50 Index Insertion : 0.00
% 6.79/2.50 Index Deletion : 0.00
% 6.79/2.50 Index Matching : 0.00
% 6.79/2.50 BG Taut test : 0.00
%------------------------------------------------------------------------------