TSTP Solution File: LCL646+1.001 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL646+1.001 : 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 : n019.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:30 EDT 2023
% Result : Theorem 2.70s 1.67s
% Output : CNFRefutation 2.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 13
% Syntax : Number of formulae : 18 ( 4 unt; 12 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 33 ( 17 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 7 >; 1 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 10 (; 9 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r1 > p6 > p5 > p4 > p3 > p2 > p1 > #nlpp > #skF_5 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p3,type,
p3: $i > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(p5,type,
p5: $i > $o ).
tff(p4,type,
p4: $i > $o ).
tff(p6,type,
p6: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(r1,type,
r1: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(p2,type,
p2: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(p1,type,
p1: $i > $o ).
tff(f_81,negated_conjecture,
~ ~ ? [X] :
~ ( ~ ! [Y] :
( ~ r1(X,Y)
| p6(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p4(Y) )
| ~ ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p5(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p3(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p2(Y) )
| ! [Y] :
( ~ r1(X,Y)
| p1(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
tff(c_6,plain,
~ p2('#skF_4'),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_8,plain,
r1('#skF_1','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_59,plain,
! [Y_15] :
( p2(Y_15)
| ~ r1('#skF_1',Y_15) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_68,plain,
p2('#skF_4'),
inference(resolution,[status(thm)],[c_8,c_59]) ).
tff(c_77,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL646+1.001 : 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.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 13:55:01 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.70/1.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.70/1.68
% 2.70/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.96/1.70
% 2.96/1.70 Inference rules
% 2.96/1.70 ----------------------
% 2.96/1.70 #Ref : 0
% 2.96/1.70 #Sup : 12
% 2.96/1.70 #Fact : 0
% 2.96/1.70 #Define : 0
% 2.96/1.70 #Split : 0
% 2.96/1.70 #Chain : 0
% 2.96/1.70 #Close : 0
% 2.96/1.70
% 2.96/1.70 Ordering : KBO
% 2.96/1.70
% 2.96/1.70 Simplification rules
% 2.96/1.70 ----------------------
% 2.96/1.70 #Subsume : 1
% 2.96/1.70 #Demod : 0
% 2.96/1.70 #Tautology : 0
% 2.96/1.70 #SimpNegUnit : 1
% 2.96/1.70 #BackRed : 0
% 2.96/1.70
% 2.96/1.70 #Partial instantiations: 0
% 2.96/1.70 #Strategies tried : 1
% 2.96/1.70
% 2.96/1.70 Timing (in seconds)
% 2.96/1.70 ----------------------
% 2.96/1.71 Preprocessing : 0.43
% 2.96/1.71 Parsing : 0.24
% 2.96/1.71 CNF conversion : 0.03
% 2.96/1.71 Main loop : 0.19
% 2.96/1.71 Inferencing : 0.08
% 2.96/1.71 Reduction : 0.05
% 2.96/1.71 Demodulation : 0.03
% 2.96/1.71 BG Simplification : 0.01
% 2.96/1.71 Subsumption : 0.04
% 2.96/1.71 Abstraction : 0.01
% 2.96/1.71 MUC search : 0.00
% 2.96/1.71 Cooper : 0.00
% 2.96/1.71 Total : 0.66
% 2.96/1.71 Index Insertion : 0.00
% 2.96/1.71 Index Deletion : 0.00
% 2.96/1.71 Index Matching : 0.00
% 2.96/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------