TSTP Solution File: LCL360-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL360-1 : TPTP v8.1.2. Released 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 : n009.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:58 EDT 2023
% Result : Unsatisfiable 2.11s 1.54s
% Output : CNFRefutation 2.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of formulae : 17 ( 8 unt; 6 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 17 (; 17 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > z > y > x
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(x,type,
x: $i ).
tff(is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(y,type,
y: $i ).
tff(not,type,
not: $i > $i ).
tff(z,type,
z: $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_38,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(not(X),Y))),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_40,axiom,
~ is_a_theorem(implies(implies(implies(not(x),y),z),implies(x,z))),
file(unknown,unknown) ).
tff(c_8,plain,
! [X_7,Y_8] : is_a_theorem(implies(X_7,implies(not(X_7),Y_8))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_35,plain,
! [X_18,Y_19,Z_20] : is_a_theorem(implies(implies(X_18,Y_19),implies(implies(Y_19,Z_20),implies(X_18,Z_20)))),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( is_a_theorem(Y_2)
| ~ is_a_theorem(X_1)
| ~ is_a_theorem(implies(X_1,Y_2)) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_40,plain,
! [Y_21,Z_22,X_23] :
( is_a_theorem(implies(implies(Y_21,Z_22),implies(X_23,Z_22)))
| ~ is_a_theorem(implies(X_23,Y_21)) ),
inference(resolution,[status(thm)],[c_35,c_2]) ).
tff(c_10,plain,
~ is_a_theorem(implies(implies(implies(not(x),y),z),implies(x,z))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_43,plain,
~ is_a_theorem(implies(x,implies(not(x),y))),
inference(resolution,[status(thm)],[c_40,c_10]) ).
tff(c_50,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL360-1 : TPTP v8.1.2. Released v2.3.0.
% 0.00/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 : n009.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:18:09 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.11/1.54 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.11/1.54
% 2.11/1.54 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.11/1.58
% 2.11/1.58 Inference rules
% 2.11/1.58 ----------------------
% 2.11/1.58 #Ref : 0
% 2.11/1.58 #Sup : 7
% 2.11/1.58 #Fact : 0
% 2.11/1.58 #Define : 0
% 2.11/1.58 #Split : 1
% 2.11/1.58 #Chain : 0
% 2.11/1.58 #Close : 0
% 2.11/1.58
% 2.11/1.58 Ordering : KBO
% 2.11/1.58
% 2.11/1.58 Simplification rules
% 2.11/1.58 ----------------------
% 2.11/1.58 #Subsume : 0
% 2.11/1.58 #Demod : 1
% 2.11/1.58 #Tautology : 1
% 2.11/1.58 #SimpNegUnit : 0
% 2.11/1.58 #BackRed : 0
% 2.11/1.58
% 2.11/1.58 #Partial instantiations: 0
% 2.11/1.58 #Strategies tried : 1
% 2.11/1.58
% 2.11/1.58 Timing (in seconds)
% 2.11/1.58 ----------------------
% 2.11/1.58 Preprocessing : 0.36
% 2.11/1.58 Parsing : 0.20
% 2.11/1.58 CNF conversion : 0.02
% 2.11/1.58 Main loop : 0.16
% 2.11/1.58 Inferencing : 0.07
% 2.11/1.58 Reduction : 0.03
% 2.11/1.58 Demodulation : 0.03
% 2.11/1.58 BG Simplification : 0.01
% 2.11/1.58 Subsumption : 0.03
% 2.11/1.58 Abstraction : 0.01
% 2.11/1.58 MUC search : 0.00
% 2.11/1.58 Cooper : 0.00
% 2.11/1.58 Total : 0.57
% 2.11/1.58 Index Insertion : 0.00
% 2.11/1.58 Index Deletion : 0.00
% 2.11/1.58 Index Matching : 0.00
% 2.11/1.58 BG Taut test : 0.00
%------------------------------------------------------------------------------