TSTP Solution File: LCL207-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL207-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 : n013.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:40 EDT 2023
% Result : Unsatisfiable 10.17s 3.79s
% Output : CNFRefutation 10.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 40 ( 17 unt; 6 typ; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 52 ( 27 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 7 ( 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 : 77 (; 77 !; 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_53,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file(unknown,unknown) ).
tff(f_86,axiom,
~ theorem(or(not(not(or(not(p),q))),or(not(q),p))),
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_106,plain,
! [Y_37,Z_38,X_39] :
( ~ theorem(or(not(Y_37),Z_38))
| ~ axiom(or(not(X_39),Y_37))
| theorem(or(not(X_39),Z_38)) ),
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_106]) ).
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_93,plain,
! [A_34,B_35,C_36] : axiom(or(not(or(A_34,or(B_35,C_36))),or(B_35,or(A_34,C_36)))),
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_97,plain,
! [A_34,B_35,C_36] :
( ~ theorem(or(A_34,or(B_35,C_36)))
| theorem(or(B_35,or(A_34,C_36))) ),
inference(resolution,[status(thm)],[c_93,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_97]) ).
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_74]) ).
tff(c_30,plain,
! [A_2,B_3] :
( ~ theorem(A_2)
| theorem(or(B_3,A_2)) ),
inference(resolution,[status(thm)],[c_4,c_22]) ).
tff(c_140,plain,
! [A_42,B_43,C_44] :
( ~ theorem(or(A_42,or(B_43,C_44)))
| theorem(or(B_43,or(A_42,C_44))) ),
inference(resolution,[status(thm)],[c_93,c_14]) ).
tff(c_195,plain,
! [B_54,B_55,C_56] :
( theorem(or(B_54,or(B_55,C_56)))
| ~ theorem(or(B_54,C_56)) ),
inference(resolution,[status(thm)],[c_30,c_140]) ).
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_3874,plain,
! [X_509,Y_510,B_511,C_512] :
( ~ axiom(or(not(X_509),Y_510))
| theorem(or(not(X_509),or(B_511,C_512)))
| ~ theorem(or(not(Y_510),C_512)) ),
inference(resolution,[status(thm)],[c_195,c_16]) ).
tff(c_4125,plain,
! [A_544,B_545,C_546,B_547] :
( theorem(or(not(A_544),or(B_545,C_546)))
| ~ theorem(or(not(or(B_547,A_544)),C_546)) ),
inference(resolution,[status(thm)],[c_4,c_3874]) ).
tff(c_9631,plain,
! [A_1011,B_1012,B_1013,A_1014] : theorem(or(not(A_1011),or(B_1012,or(not(not(or(B_1013,A_1011))),A_1014)))),
inference(resolution,[status(thm)],[c_482,c_4125]) ).
tff(c_9695,plain,
! [B_1027,A_1028,B_1029,A_1030] : theorem(or(B_1027,or(not(A_1028),or(not(not(or(B_1029,A_1028))),A_1030)))),
inference(resolution,[status(thm)],[c_9631,c_97]) ).
tff(c_2,plain,
! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
inference(cnfTransformation,[status(thm)],[f_53]) ).
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_9746,plain,
! [A_1031,B_1032,A_1033] : theorem(or(not(A_1031),or(not(not(or(B_1032,A_1031))),A_1033))),
inference(resolution,[status(thm)],[c_9695,c_29]) ).
tff(c_9762,plain,
! [B_1032,A_1031,A_1033] : theorem(or(not(not(or(B_1032,A_1031))),or(not(A_1031),A_1033))),
inference(resolution,[status(thm)],[c_9746,c_97]) ).
tff(c_18,plain,
~ theorem(or(not(not(or(not(p),q))),or(not(q),p))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_9775,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_9762,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL207-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.14 % 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.36 % Computer : n013.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:02:02 EDT 2023
% 0.14/0.36 % CPUTime :
% 10.17/3.79 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.17/3.80
% 10.17/3.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 10.17/3.83
% 10.17/3.83 Inference rules
% 10.17/3.83 ----------------------
% 10.17/3.83 #Ref : 0
% 10.17/3.83 #Sup : 2175
% 10.17/3.83 #Fact : 0
% 10.17/3.83 #Define : 0
% 10.17/3.83 #Split : 0
% 10.17/3.83 #Chain : 0
% 10.17/3.83 #Close : 0
% 10.17/3.83
% 10.17/3.83 Ordering : KBO
% 10.17/3.83
% 10.17/3.83 Simplification rules
% 10.17/3.83 ----------------------
% 10.17/3.83 #Subsume : 370
% 10.17/3.83 #Demod : 746
% 10.17/3.83 #Tautology : 749
% 10.17/3.83 #SimpNegUnit : 0
% 10.17/3.83 #BackRed : 1
% 10.17/3.83
% 10.17/3.83 #Partial instantiations: 0
% 10.17/3.83 #Strategies tried : 1
% 10.17/3.83
% 10.17/3.83 Timing (in seconds)
% 10.17/3.83 ----------------------
% 10.17/3.83 Preprocessing : 0.41
% 10.17/3.83 Parsing : 0.23
% 10.17/3.83 CNF conversion : 0.02
% 10.17/3.83 Main loop : 2.35
% 10.17/3.83 Inferencing : 0.74
% 10.17/3.83 Reduction : 0.74
% 10.17/3.83 Demodulation : 0.57
% 10.17/3.83 BG Simplification : 0.03
% 10.17/3.83 Subsumption : 0.71
% 10.17/3.83 Abstraction : 0.04
% 10.17/3.83 MUC search : 0.00
% 10.17/3.84 Cooper : 0.00
% 10.17/3.84 Total : 2.81
% 10.17/3.84 Index Insertion : 0.00
% 10.17/3.84 Index Deletion : 0.00
% 10.17/3.84 Index Matching : 0.00
% 10.17/3.84 BG Taut test : 0.00
%------------------------------------------------------------------------------