TSTP Solution File: LCL194-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL194-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n004.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:47:37 EDT 2023
% Result : Unsatisfiable 58.35s 47.89s
% Output : CNFRefutation 58.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 29 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 20 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 49 (; 49 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > #nlpp > not > r > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(r,type,
r: $i ).
tff(theorem,type,
theorem: $i > $o ).
tff(or,type,
or: ( $i * $i ) > $i ).
tff(not,type,
not: $i > $i ).
tff(q,type,
q: $i ).
tff(axiom,type,
axiom: $i > $o ).
tff(p,type,
p: $i ).
tff(f_61,axiom,
! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file(unknown,unknown) ).
tff(f_57,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_74,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_82,axiom,
! [X,Z,Y] :
( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y))
| ~ theorem(or(not(Y),Z)) ),
file(unknown,unknown) ).
tff(f_86,axiom,
~ theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))),
file(unknown,unknown) ).
tff(c_10,plain,
! [A_9,B_10,C_11] : axiom(or(not(or(not(A_9),B_10)),or(not(or(C_11,A_9)),or(C_11,B_10)))),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_6,plain,
! [A_4,B_5] : axiom(or(not(or(A_4,B_5)),or(B_5,A_4))),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_12,plain,
! [X_12] :
( ~ axiom(X_12)
| theorem(X_12) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_56,plain,
! [A_32,B_33,C_34] : axiom(or(not(or(A_32,or(B_33,C_34))),or(B_33,or(A_32,C_34)))),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_14,plain,
! [Y_14,X_13] :
( ~ theorem(Y_14)
| ~ axiom(or(not(Y_14),X_13))
| theorem(X_13) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_79,plain,
! [A_39,B_40,C_41] :
( ~ theorem(or(A_39,or(B_40,C_41)))
| theorem(or(B_40,or(A_39,C_41))) ),
inference(resolution,[status(thm)],[c_56,c_14]) ).
tff(c_461,plain,
! [B_84,A_85,C_86] :
( theorem(or(B_84,or(A_85,C_86)))
| ~ axiom(or(A_85,or(B_84,C_86))) ),
inference(resolution,[status(thm)],[c_12,c_79]) ).
tff(c_16,plain,
! [Y_17,Z_16,X_15] :
( ~ theorem(or(not(Y_17),Z_16))
| ~ axiom(or(not(X_15),Y_17))
| theorem(or(not(X_15),Z_16)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_5755,plain,
! [X_689,Y_690,A_691,C_692] :
( ~ axiom(or(not(X_689),Y_690))
| theorem(or(not(X_689),or(A_691,C_692)))
| ~ axiom(or(A_691,or(not(Y_690),C_692))) ),
inference(resolution,[status(thm)],[c_461,c_16]) ).
tff(c_15149,plain,
! [A_1626,B_1627,A_1628,C_1629] :
( theorem(or(not(or(A_1626,B_1627)),or(A_1628,C_1629)))
| ~ axiom(or(A_1628,or(not(or(B_1627,A_1626)),C_1629))) ),
inference(resolution,[status(thm)],[c_6,c_5755]) ).
tff(c_60,plain,
! [A_32,B_33,C_34] :
( ~ theorem(or(A_32,or(B_33,C_34)))
| theorem(or(B_33,or(A_32,C_34))) ),
inference(resolution,[status(thm)],[c_56,c_14]) ).
tff(c_85425,plain,
! [A_5659,A_5660,B_5661,C_5662] :
( theorem(or(A_5659,or(not(or(A_5660,B_5661)),C_5662)))
| ~ axiom(or(A_5659,or(not(or(B_5661,A_5660)),C_5662))) ),
inference(resolution,[status(thm)],[c_15149,c_60]) ).
tff(c_18,plain,
~ theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_85479,plain,
~ axiom(or(not(or(not(q),r)),or(not(or(p,q)),or(p,r)))),
inference(resolution,[status(thm)],[c_85425,c_18]) ).
tff(c_85517,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_85479]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL194-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 13:54:26 EDT 2023
% 0.13/0.34 % CPUTime :
% 58.35/47.89 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 58.35/47.90
% 58.35/47.90 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 58.48/47.93
% 58.48/47.93 Inference rules
% 58.48/47.93 ----------------------
% 58.48/47.93 #Ref : 0
% 58.48/47.93 #Sup : 19110
% 58.48/47.93 #Fact : 0
% 58.48/47.93 #Define : 0
% 58.48/47.93 #Split : 0
% 58.48/47.93 #Chain : 0
% 58.48/47.93 #Close : 0
% 58.48/47.93
% 58.48/47.93 Ordering : KBO
% 58.48/47.93
% 58.48/47.93 Simplification rules
% 58.48/47.93 ----------------------
% 58.48/47.93 #Subsume : 1417
% 58.48/47.93 #Demod : 7080
% 58.48/47.93 #Tautology : 7087
% 58.48/47.93 #SimpNegUnit : 0
% 58.48/47.93 #BackRed : 0
% 58.48/47.93
% 58.48/47.93 #Partial instantiations: 0
% 58.48/47.93 #Strategies tried : 1
% 58.48/47.93
% 58.48/47.93 Timing (in seconds)
% 58.48/47.93 ----------------------
% 58.48/47.93 Preprocessing : 0.44
% 58.48/47.93 Parsing : 0.24
% 58.48/47.93 CNF conversion : 0.02
% 58.48/47.93 Main loop : 46.43
% 58.48/47.93 Inferencing : 5.58
% 58.48/47.93 Reduction : 19.27
% 58.48/47.93 Demodulation : 16.46
% 58.48/47.93 BG Simplification : 0.10
% 58.48/47.93 Subsumption : 19.73
% 58.48/47.93 Abstraction : 0.18
% 58.48/47.93 MUC search : 0.00
% 58.48/47.93 Cooper : 0.00
% 58.48/47.93 Total : 46.92
% 58.48/47.93 Index Insertion : 0.00
% 58.48/47.93 Index Deletion : 0.00
% 58.48/47.93 Index Matching : 0.00
% 58.48/47.93 BG Taut test : 0.00
%------------------------------------------------------------------------------