TSTP Solution File: LCL236-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL236-1 : TPTP v8.1.2. Bugfixed v2.3.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 : n024.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:45 EDT 2023
% Result : Unsatisfiable 3.39s 1.84s
% Output : CNFRefutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 29 ( 13 unt; 6 typ; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 15 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 6 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 37 (; 37 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > #nlpp > not > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
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_56,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file(unknown,unknown) ).
tff(f_67,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_60,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_75,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file(unknown,unknown) ).
tff(f_58,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file(unknown,unknown) ).
tff(f_87,axiom,
~ theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))),
file(unknown,unknown) ).
tff(c_4,plain,
! [A_2,B_3] : axiom(or(not(A_2),or(B_3,A_2))),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_12,plain,
! [X_12] :
( ~ axiom(X_12)
| theorem(X_12) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
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_60]) ).
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_75]) ).
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_323,plain,
! [B_78,A_79,C_80] :
( theorem(or(B_78,or(A_79,C_80)))
| ~ axiom(or(A_79,or(B_78,C_80))) ),
inference(resolution,[status(thm)],[c_12,c_79]) ).
tff(c_2,plain,
! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_22,plain,
! [Y_22,X_23] :
( ~ theorem(Y_22)
| ~ axiom(or(not(Y_22),X_23))
| theorem(X_23) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_29,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_22]) ).
tff(c_383,plain,
! [A_87,C_88] :
( theorem(or(A_87,C_88))
| ~ axiom(or(A_87,or(or(A_87,C_88),C_88))) ),
inference(resolution,[status(thm)],[c_323,c_29]) ).
tff(c_389,plain,
! [A_89] : theorem(or(not(A_89),A_89)),
inference(resolution,[status(thm)],[c_4,c_383]) ).
tff(c_36,plain,
! [A_25,B_26] : axiom(or(not(or(A_25,B_26)),or(B_26,A_25))),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_40,plain,
! [A_25,B_26] :
( ~ theorem(or(A_25,B_26))
| theorem(or(B_26,A_25)) ),
inference(resolution,[status(thm)],[c_36,c_14]) ).
tff(c_399,plain,
! [A_89] : theorem(or(A_89,not(A_89))),
inference(resolution,[status(thm)],[c_389,c_40]) ).
tff(c_18,plain,
~ theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_402,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_399,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : LCL236-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.12/0.15 % 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.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 14:04:00 EDT 2023
% 0.21/0.36 % CPUTime :
% 3.39/1.84 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.39/1.84
% 3.39/1.84 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.39/1.87
% 3.39/1.87 Inference rules
% 3.39/1.87 ----------------------
% 3.39/1.87 #Ref : 0
% 3.39/1.87 #Sup : 87
% 3.39/1.87 #Fact : 0
% 3.39/1.87 #Define : 0
% 3.39/1.87 #Split : 0
% 3.39/1.87 #Chain : 0
% 3.39/1.87 #Close : 0
% 3.39/1.87
% 3.39/1.87 Ordering : KBO
% 3.39/1.87
% 3.39/1.87 Simplification rules
% 3.39/1.87 ----------------------
% 3.39/1.87 #Subsume : 32
% 3.39/1.87 #Demod : 1
% 3.39/1.87 #Tautology : 3
% 3.39/1.87 #SimpNegUnit : 0
% 3.39/1.87 #BackRed : 1
% 3.39/1.87
% 3.39/1.87 #Partial instantiations: 0
% 3.39/1.87 #Strategies tried : 1
% 3.39/1.87
% 3.39/1.87 Timing (in seconds)
% 3.39/1.87 ----------------------
% 3.39/1.87 Preprocessing : 0.42
% 3.39/1.87 Parsing : 0.23
% 3.39/1.87 CNF conversion : 0.02
% 3.39/1.87 Main loop : 0.38
% 3.39/1.87 Inferencing : 0.17
% 3.39/1.87 Reduction : 0.08
% 3.39/1.87 Demodulation : 0.05
% 3.39/1.87 BG Simplification : 0.01
% 3.39/1.87 Subsumption : 0.09
% 3.39/1.87 Abstraction : 0.01
% 3.39/1.87 MUC search : 0.00
% 3.39/1.87 Cooper : 0.00
% 3.39/1.87 Total : 0.85
% 3.39/1.87 Index Insertion : 0.00
% 3.39/1.87 Index Deletion : 0.00
% 3.39/1.87 Index Matching : 0.00
% 3.39/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------