TSTP Solution File: LCL644+1.005 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL644+1.005 : 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 : n023.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:48:29 EDT 2023
% Result : Theorem 254.63s 243.20s
% Output : CNFRefutation 254.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 46
% Syntax : Number of formulae : 49 ( 3 unt; 45 typ; 0 def)
% Number of atoms : 228 ( 0 equ)
% Maximal formula atoms : 225 ( 57 avg)
% Number of connectives : 359 ( 135 ~; 152 |; 72 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 17 >; 1 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 38 ( 38 usr; 28 con; 0-1 aty)
% Number of variables : 80 (; 79 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r1 > p6 > p5 > p4 > p3 > p2 > p1 > #nlpp > #skF_9 > #skF_16 > #skF_20 > #skF_2 > #skF_18 > #skF_24 > #skF_11 > #skF_31 > #skF_15 > #skF_25 > #skF_38 > #skF_36 > #skF_19 > #skF_7 > #skF_37 > #skF_26 > #skF_32 > #skF_14 > #skF_5 > #skF_10 > #skF_6 > #skF_13 > #skF_1 > #skF_21 > #skF_23 > #skF_33 > #skF_8 > #skF_30 > #skF_4 > #skF_17 > #skF_3 > #skF_22 > #skF_29 > #skF_28 > #skF_35 > #skF_27 > #skF_12 > #skF_34
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff(p3,type,
p3: $i > $o ).
tff('#skF_16',type,
'#skF_16': $i > $i ).
tff('#skF_20',type,
'#skF_20': $i ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_18',type,
'#skF_18': $i ).
tff('#skF_24',type,
'#skF_24': $i > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_31',type,
'#skF_31': $i ).
tff('#skF_15',type,
'#skF_15': $i ).
tff('#skF_25',type,
'#skF_25': $i ).
tff('#skF_38',type,
'#skF_38': $i ).
tff('#skF_36',type,
'#skF_36': $i ).
tff('#skF_19',type,
'#skF_19': $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_37',type,
'#skF_37': $i ).
tff('#skF_26',type,
'#skF_26': $i ).
tff('#skF_32',type,
'#skF_32': $i > $i ).
tff('#skF_14',type,
'#skF_14': $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff(p5,type,
p5: $i > $o ).
tff(p4,type,
p4: $i > $o ).
tff(p6,type,
p6: $i > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_13',type,
'#skF_13': $i ).
tff(r1,type,
r1: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_21',type,
'#skF_21': $i ).
tff(p2,type,
p2: $i > $o ).
tff('#skF_23',type,
'#skF_23': $i > $i ).
tff('#skF_33',type,
'#skF_33': $i > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_30',type,
'#skF_30': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_17',type,
'#skF_17': $i > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_22',type,
'#skF_22': $i ).
tff('#skF_29',type,
'#skF_29': $i ).
tff('#skF_28',type,
'#skF_28': $i ).
tff('#skF_35',type,
'#skF_35': $i ).
tff('#skF_27',type,
'#skF_27': $i ).
tff(p1,type,
p1: $i > $o ).
tff('#skF_12',type,
'#skF_12': $i ).
tff('#skF_34',type,
'#skF_34': $i ).
tff(f_689,negated_conjecture,
~ ~ ? [X] :
~ ( ~ ( ! [Y] :
( ~ r1(X,Y)
| ~ ( p6(Y)
& ! [X] :
( ~ r1(Y,X)
| p6(X) ) )
| p5(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p6(Y)
| ~ ( p5(Y)
& ! [X] :
( ~ r1(Y,X)
| p5(X) )
& p5(Y) ) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ! [X] :
( ~ r1(Y,X)
| ~ ( p6(X)
& ! [Y] :
( ~ r1(X,Y)
| p6(Y) ) )
| p5(X) )
| p6(Y)
| ~ ( p5(Y)
& ! [X] :
( ~ r1(Y,X)
| p5(X) )
& p5(Y) ) )
& ! [Y] :
( ~ r1(X,Y)
| ~ ( p6(Y)
& ! [X] :
( ~ r1(Y,X)
| p6(X) ) )
| p5(Y)
| ! [X] :
( ~ r1(Y,X)
| p6(X)
| ~ ( p5(X)
& ! [Y] :
( ~ r1(X,Y)
| p5(Y) )
& p5(X) ) ) )
& ! [Y] :
( ~ r1(X,Y)
| ~ ( p6(Y)
& ! [X] :
( ~ r1(Y,X)
| p6(X) ) )
| p5(Y)
| p6(Y)
| ~ ( p5(Y)
& ! [X] :
( ~ r1(Y,X)
| p5(X) )
& p5(Y) ) ) ) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ~ ( p5(Y)
& ! [X] :
( ~ r1(Y,X)
| p5(X) ) )
| p4(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p5(Y)
| ~ ( p4(Y)
& ! [X] :
( ~ r1(Y,X)
| p4(X) )
& p4(Y) ) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ! [X] :
( ~ r1(Y,X)
| ~ ( p5(X)
& ! [Y] :
( ~ r1(X,Y)
| p5(Y) ) )
| p4(X) )
| p5(Y)
| ~ ( p4(Y)
& ! [X] :
( ~ r1(Y,X)
| p4(X) )
& p4(Y) ) )
& ! [Y] :
( ~ r1(X,Y)
| ~ ( p5(Y)
& ! [X] :
( ~ r1(Y,X)
| p5(X) ) )
| p4(Y)
| ! [X] :
( ~ r1(Y,X)
| p5(X)
| ~ ( p4(X)
& ! [Y] :
( ~ r1(X,Y)
| p4(Y) )
& p4(X) ) ) )
& ! [Y] :
( ~ r1(X,Y)
| ~ ( p5(Y)
& ! [X] :
( ~ r1(Y,X)
| p5(X) ) )
| p4(Y)
| p5(Y)
| ~ ( p4(Y)
& ! [X] :
( ~ r1(Y,X)
| p4(X) )
& p4(Y) ) ) ) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ~ ( p4(Y)
& ! [X] :
( ~ r1(Y,X)
| p4(X) ) )
| p3(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p4(Y)
| ~ ( p3(Y)
& ! [X] :
( ~ r1(Y,X)
| p3(X) )
& p3(Y) ) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ! [X] :
( ~ r1(Y,X)
| ~ ( p4(X)
& ! [Y] :
( ~ r1(X,Y)
| p4(Y) ) )
| p3(X) )
| p4(Y)
| ~ ( p3(Y)
& ! [X] :
( ~ r1(Y,X)
| p3(X) )
& p3(Y) ) )
& ! [Y] :
( ~ r1(X,Y)
| ~ ( p4(Y)
& ! [X] :
( ~ r1(Y,X)
| p4(X) ) )
| p3(Y)
| ! [X] :
( ~ r1(Y,X)
| p4(X)
| ~ ( p3(X)
& ! [Y] :
( ~ r1(X,Y)
| p3(Y) )
& p3(X) ) ) )
& ! [Y] :
( ~ r1(X,Y)
| ~ ( p4(Y)
& ! [X] :
( ~ r1(Y,X)
| p4(X) ) )
| p3(Y)
| p4(Y)
| ~ ( p3(Y)
& ! [X] :
( ~ r1(Y,X)
| p3(X) )
& p3(Y) ) ) ) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ~ ( p3(Y)
& ! [X] :
( ~ r1(Y,X)
| p3(X) ) )
| p2(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p3(Y)
| ~ ( p2(Y)
& ! [X] :
( ~ r1(Y,X)
| p2(X) )
& p2(Y) ) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ! [X] :
( ~ r1(Y,X)
| ~ ( p3(X)
& ! [Y] :
( ~ r1(X,Y)
| p3(Y) ) )
| p2(X) )
| p3(Y)
| ~ ( p2(Y)
& ! [X] :
( ~ r1(Y,X)
| p2(X) )
& p2(Y) ) )
& ! [Y] :
( ~ r1(X,Y)
| ~ ( p3(Y)
& ! [X] :
( ~ r1(Y,X)
| p3(X) ) )
| p2(Y)
| ! [X] :
( ~ r1(Y,X)
| p3(X)
| ~ ( p2(X)
& ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
& p2(X) ) ) )
& ! [Y] :
( ~ r1(X,Y)
| ~ ( p3(Y)
& ! [X] :
( ~ r1(Y,X)
| p3(X) ) )
| p2(Y)
| p3(Y)
| ~ ( p2(Y)
& ! [X] :
( ~ r1(Y,X)
| p2(X) )
& p2(Y) ) ) ) )
| ! [Y] :
( ~ r1(X,Y)
| p5(Y)
| ~ ( ! [X] :
( ~ r1(Y,X)
| p5(X) )
& p5(Y) ) )
| ! [Y] :
( ~ r1(X,Y)
| p5(Y)
| ~ ( ! [X] :
( ~ r1(Y,X)
| p5(X) )
& p5(Y) ) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ~ ( p2(Y)
& ! [X] :
( ~ r1(Y,X)
| p2(X) ) )
| p1(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p2(Y)
| ~ ( p1(Y)
& ! [X] :
( ~ r1(Y,X)
| p1(X) )
& p1(Y) ) )
| ~ ( ! [Y] :
( ~ r1(X,Y)
| ! [X] :
( ~ r1(Y,X)
| ~ ( p2(X)
& ! [Y] :
( ~ r1(X,Y)
| p2(Y) ) )
| p1(X) )
| p2(Y)
| ~ ( p1(Y)
& ! [X] :
( ~ r1(Y,X)
| p1(X) )
& p1(Y) ) )
& ! [Y] :
( ~ r1(X,Y)
| ~ ( p2(Y)
& ! [X] :
( ~ r1(Y,X)
| p2(X) ) )
| p1(Y)
| ! [X] :
( ~ r1(Y,X)
| p2(X)
| ~ ( p1(X)
& ! [Y] :
( ~ r1(X,Y)
| p1(Y) )
& p1(X) ) ) )
& ! [Y] :
( ~ r1(X,Y)
| ~ ( p2(Y)
& ! [X] :
( ~ r1(Y,X)
| p2(X) ) )
| p1(Y)
| p2(Y)
| ~ ( p1(Y)
& ! [X] :
( ~ r1(Y,X)
| p1(X) )
& p1(Y) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
tff(c_14,plain,
~ p5('#skF_30'),
inference(cnfTransformation,[status(thm)],[f_689]) ).
tff(c_10,plain,
p5('#skF_30'),
inference(cnfTransformation,[status(thm)],[f_689]) ).
tff(c_25937,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_14,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL644+1.005 : TPTP v8.1.2. Released v4.0.0.
% 0.08/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.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 14:09:52 EDT 2023
% 0.14/0.36 % CPUTime :
% 254.63/243.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 254.63/243.21
% 254.63/243.21 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 254.63/243.25
% 254.63/243.25 Inference rules
% 254.63/243.25 ----------------------
% 254.63/243.25 #Ref : 0
% 254.63/243.25 #Sup : 0
% 254.63/243.25 #Fact : 0
% 254.63/243.25 #Define : 0
% 254.63/243.25 #Split : 0
% 254.63/243.25 #Chain : 0
% 254.63/243.25 #Close : 0
% 254.63/243.25
% 254.63/243.25 Ordering : KBO
% 254.63/243.25
% 254.63/243.25 Simplification rules
% 254.63/243.25 ----------------------
% 254.63/243.25 #Subsume : 12967
% 254.63/243.25 #Demod : 0
% 254.63/243.25 #Tautology : 0
% 254.63/243.25 #SimpNegUnit : 1
% 254.63/243.25 #BackRed : 0
% 254.63/243.25
% 254.63/243.25 #Partial instantiations: 0
% 254.63/243.25 #Strategies tried : 1
% 254.63/243.25
% 254.63/243.25 Timing (in seconds)
% 254.63/243.25 ----------------------
% 254.63/243.25 Preprocessing : 2.23
% 254.63/243.25 Parsing : 0.38
% 254.63/243.25 CNF conversion : 0.29
% 254.63/243.25 Main loop : 239.85
% 254.63/243.25 Inferencing : 0.00
% 254.63/243.25 Reduction : 183.70
% 254.63/243.25 Demodulation : 153.08
% 254.63/243.25 BG Simplification : 0.81
% 254.63/243.25 Subsumption : 43.94
% 254.63/243.25 Abstraction : 1.56
% 254.63/243.25 MUC search : 0.00
% 254.63/243.26 Cooper : 0.00
% 254.63/243.26 Total : 242.14
% 254.63/243.26 Index Insertion : 0.00
% 254.63/243.26 Index Deletion : 0.00
% 254.63/243.26 Index Matching : 0.00
% 254.63/243.26 BG Taut test : 0.00
%------------------------------------------------------------------------------