TSTP Solution File: LCL176-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL176-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 : n005.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:33 EDT 2023
% Result : Unsatisfiable 3.36s 1.89s
% Output : CNFRefutation 3.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 19 ( 8 unt; 5 typ; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 21 (; 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > #nlpp > not > 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(axiom,type,
axiom: $i > $o ).
tff(p,type,
p: $i ).
tff(f_54,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file(unknown,unknown) ).
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_83,axiom,
! [X,Z,Y] :
( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y))
| ~ theorem(or(not(Y),Z)) ),
file(unknown,unknown) ).
tff(f_87,axiom,
~ theorem(or(not(p),p)),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
inference(cnfTransformation,[status(thm)],[f_54]) ).
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_86,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_83]) ).
tff(c_333,plain,
! [X_81,Y_82,Z_83] :
( ~ axiom(or(not(X_81),Y_82))
| theorem(or(not(X_81),Z_83))
| ~ axiom(or(not(Y_82),Z_83)) ),
inference(resolution,[status(thm)],[c_12,c_86]) ).
tff(c_374,plain,
! [A_87,Z_88,B_89] :
( theorem(or(not(A_87),Z_88))
| ~ axiom(or(not(or(B_89,A_87)),Z_88)) ),
inference(resolution,[status(thm)],[c_4,c_333]) ).
tff(c_395,plain,
! [A_1] : theorem(or(not(A_1),A_1)),
inference(resolution,[status(thm)],[c_2,c_374]) ).
tff(c_18,plain,
~ theorem(or(not(p),p)),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_398,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_395,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL176-1 : TPTP v8.1.2. Released v1.1.0.
% 0.13/0.14 % 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.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 13:22:12 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.36/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.36/1.89
% 3.36/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.52/1.91
% 3.52/1.91 Inference rules
% 3.52/1.91 ----------------------
% 3.52/1.91 #Ref : 0
% 3.52/1.91 #Sup : 87
% 3.52/1.91 #Fact : 0
% 3.52/1.92 #Define : 0
% 3.52/1.92 #Split : 0
% 3.52/1.92 #Chain : 0
% 3.52/1.92 #Close : 0
% 3.52/1.92
% 3.52/1.92 Ordering : KBO
% 3.52/1.92
% 3.52/1.92 Simplification rules
% 3.52/1.92 ----------------------
% 3.52/1.92 #Subsume : 30
% 3.52/1.92 #Demod : 1
% 3.52/1.92 #Tautology : 3
% 3.52/1.92 #SimpNegUnit : 0
% 3.52/1.92 #BackRed : 1
% 3.52/1.92
% 3.52/1.92 #Partial instantiations: 0
% 3.52/1.92 #Strategies tried : 1
% 3.52/1.92
% 3.52/1.92 Timing (in seconds)
% 3.52/1.92 ----------------------
% 3.52/1.92 Preprocessing : 0.42
% 3.52/1.92 Parsing : 0.23
% 3.52/1.92 CNF conversion : 0.02
% 3.52/1.92 Main loop : 0.44
% 3.52/1.92 Inferencing : 0.20
% 3.52/1.92 Reduction : 0.09
% 3.52/1.92 Demodulation : 0.06
% 3.52/1.92 BG Simplification : 0.02
% 3.52/1.92 Subsumption : 0.11
% 3.52/1.92 Abstraction : 0.01
% 3.52/1.92 MUC search : 0.00
% 3.52/1.92 Cooper : 0.00
% 3.52/1.92 Total : 0.90
% 3.52/1.92 Index Insertion : 0.00
% 3.52/1.92 Index Deletion : 0.00
% 3.52/1.92 Index Matching : 0.00
% 3.52/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------