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