TSTP Solution File: LCL648+1.001 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL648+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 : n032.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.33s 1.50s
% Output : CNFRefutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 12 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 21 ( 13 ~; 6 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 4 (; 3 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r1 > p201 > p101 > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p101,type,
p101: $i > $o ).
tff(p201,type,
p201: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(r1,type,
r1: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_48,negated_conjecture,
~ ~ ? [X] :
~ ( ~ ! [Y] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) )
| ! [Y] :
( ~ r1(X,Y)
| ~ ( p201(Y)
& p101(Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
tff(c_4,plain,
p201('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_2,plain,
p101('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_6,plain,
r1('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_9,plain,
! [Y_4] :
( ~ p101(Y_4)
| ~ p201(Y_4)
| ~ r1('#skF_1',Y_4) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_12,plain,
( ~ p101('#skF_2')
| ~ p201('#skF_2') ),
inference(resolution,[status(thm)],[c_6,c_9]) ).
tff(c_16,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL648+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % 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.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu Aug 3 14:01:36 EDT 2023
% 0.11/0.32 % CPUTime :
% 2.33/1.50 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.33/1.50
% 2.33/1.50 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.33/1.53
% 2.33/1.53 Inference rules
% 2.33/1.53 ----------------------
% 2.33/1.53 #Ref : 0
% 2.33/1.53 #Sup : 1
% 2.33/1.53 #Fact : 0
% 2.33/1.53 #Define : 0
% 2.33/1.53 #Split : 0
% 2.33/1.53 #Chain : 0
% 2.33/1.53 #Close : 0
% 2.33/1.53
% 2.33/1.53 Ordering : KBO
% 2.33/1.53
% 2.33/1.53 Simplification rules
% 2.33/1.53 ----------------------
% 2.33/1.53 #Subsume : 0
% 2.33/1.53 #Demod : 2
% 2.33/1.53 #Tautology : 0
% 2.33/1.53 #SimpNegUnit : 0
% 2.33/1.53 #BackRed : 0
% 2.33/1.53
% 2.33/1.53 #Partial instantiations: 0
% 2.33/1.53 #Strategies tried : 1
% 2.33/1.53
% 2.33/1.53 Timing (in seconds)
% 2.33/1.53 ----------------------
% 2.33/1.53 Preprocessing : 0.38
% 2.33/1.53 Parsing : 0.22
% 2.33/1.53 CNF conversion : 0.02
% 2.33/1.53 Main loop : 0.13
% 2.33/1.53 Inferencing : 0.07
% 2.33/1.53 Reduction : 0.02
% 2.33/1.53 Demodulation : 0.02
% 2.33/1.53 BG Simplification : 0.01
% 2.33/1.53 Subsumption : 0.02
% 2.33/1.53 Abstraction : 0.00
% 2.33/1.53 MUC search : 0.00
% 2.33/1.53 Cooper : 0.00
% 2.33/1.53 Total : 0.55
% 2.33/1.53 Index Insertion : 0.00
% 2.33/1.53 Index Deletion : 0.00
% 2.33/1.53 Index Matching : 0.00
% 2.33/1.53 BG Taut test : 0.00
%------------------------------------------------------------------------------