TSTP Solution File: LCL187-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL187-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/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 : 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:35 EDT 2023
% Result : Unsatisfiable 3.46s 1.92s
% Output : CNFRefutation 3.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 26 ( 11 unt; 6 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 39 (; 39 !; 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_57,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file(unknown,unknown) ).
tff(f_55,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
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_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_86,axiom,
~ theorem(or(not(p),or(not(not(p)),q))),
file(unknown,unknown) ).
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_4,plain,
! [A_2,B_3] : axiom(or(not(A_2),or(B_3,A_2))),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_12,plain,
! [X_12] :
( ~ axiom(X_12)
| theorem(X_12) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_81,plain,
! [Y_35,Z_36,X_37] :
( ~ theorem(or(not(Y_35),Z_36))
| ~ axiom(or(not(X_37),Y_35))
| theorem(or(not(X_37),Z_36)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_406,plain,
! [X_84,Y_85,Z_86] :
( ~ axiom(or(not(X_84),Y_85))
| theorem(or(not(X_84),Z_86))
| ~ axiom(or(not(Y_85),Z_86)) ),
inference(resolution,[status(thm)],[c_12,c_81]) ).
tff(c_442,plain,
! [A_89,Z_90,B_91] :
( theorem(or(not(A_89),Z_90))
| ~ axiom(or(not(or(B_91,A_89)),Z_90)) ),
inference(resolution,[status(thm)],[c_4,c_406]) ).
tff(c_475,plain,
! [B_93,A_94] : theorem(or(not(B_93),or(B_93,A_94))),
inference(resolution,[status(thm)],[c_6,c_442]) ).
tff(c_56,plain,
! [A_30,B_31,C_32] : axiom(or(not(or(A_30,or(B_31,C_32))),or(B_31,or(A_30,C_32)))),
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_60,plain,
! [A_30,B_31,C_32] :
( ~ theorem(or(A_30,or(B_31,C_32)))
| theorem(or(B_31,or(A_30,C_32))) ),
inference(resolution,[status(thm)],[c_56,c_14]) ).
tff(c_482,plain,
! [B_93,A_94] : theorem(or(B_93,or(not(B_93),A_94))),
inference(resolution,[status(thm)],[c_475,c_60]) ).
tff(c_18,plain,
~ theorem(or(not(p),or(not(not(p)),q))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_507,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_482,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LCL187-1 : TPTP v8.1.2. Released v1.1.0.
% 0.08/0.15 % 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 : n024.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:56:00 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.46/1.92 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.46/1.92
% 3.46/1.92 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.46/1.95
% 3.46/1.95 Inference rules
% 3.46/1.95 ----------------------
% 3.46/1.95 #Ref : 0
% 3.46/1.95 #Sup : 114
% 3.46/1.95 #Fact : 0
% 3.46/1.95 #Define : 0
% 3.46/1.95 #Split : 0
% 3.46/1.95 #Chain : 0
% 3.46/1.95 #Close : 0
% 3.46/1.95
% 3.46/1.95 Ordering : KBO
% 3.46/1.95
% 3.46/1.95 Simplification rules
% 3.46/1.95 ----------------------
% 3.46/1.95 #Subsume : 34
% 3.46/1.95 #Demod : 4
% 3.46/1.95 #Tautology : 6
% 3.46/1.95 #SimpNegUnit : 0
% 3.46/1.95 #BackRed : 1
% 3.46/1.95
% 3.46/1.95 #Partial instantiations: 0
% 3.46/1.95 #Strategies tried : 1
% 3.46/1.95
% 3.46/1.95 Timing (in seconds)
% 3.46/1.95 ----------------------
% 3.46/1.96 Preprocessing : 0.43
% 3.46/1.96 Parsing : 0.23
% 3.46/1.96 CNF conversion : 0.02
% 3.46/1.96 Main loop : 0.44
% 3.46/1.96 Inferencing : 0.19
% 3.46/1.96 Reduction : 0.10
% 3.46/1.96 Demodulation : 0.07
% 3.46/1.96 BG Simplification : 0.02
% 3.46/1.96 Subsumption : 0.10
% 3.46/1.96 Abstraction : 0.01
% 3.46/1.96 MUC search : 0.00
% 3.46/1.96 Cooper : 0.00
% 3.46/1.96 Total : 0.92
% 3.46/1.96 Index Insertion : 0.00
% 3.46/1.96 Index Deletion : 0.00
% 3.46/1.96 Index Matching : 0.00
% 3.46/1.96 BG Taut test : 0.00
%------------------------------------------------------------------------------