TSTP Solution File: LCL161-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL161-1 : TPTP v8.1.2. Released v1.0.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 : n008.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:30 EDT 2023
% Result : Unsatisfiable 3.72s 2.04s
% Output : CNFRefutation 4.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 34 ( 27 unt; 7 typ; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 34 (; 34 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ xor > implies > and_star > #nlpp > not > x > truth > falsehood
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(truth,type,
truth: $i ).
tff(x,type,
x: $i ).
tff(falsehood,type,
falsehood: $i ).
tff(xor,type,
xor: ( $i * $i ) > $i ).
tff(not,type,
not: $i > $i ).
tff(and_star,type,
and_star: ( $i * $i ) > $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_50,axiom,
! [X] : ( xor(X,falsehood) = X ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [X] : ( xor(X,X) = falsehood ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X] : ( not(X) = xor(X,truth) ),
file(unknown,unknown) ).
tff(f_60,axiom,
! [X,Y] : ( xor(X,xor(truth,Y)) = xor(xor(X,truth),Y) ),
file(unknown,unknown) ).
tff(f_73,axiom,
! [X,Y] : ( and_star(X,Y) = and_star(Y,X) ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [X] : ( and_star(X,truth) = X ),
file(unknown,unknown) ).
tff(f_69,axiom,
! [X,Y] : ( xor(X,Y) = xor(Y,X) ),
file(unknown,unknown) ).
tff(f_78,axiom,
! [X,Y] : ( implies(X,Y) = xor(truth,and_star(X,xor(truth,Y))) ),
file(unknown,unknown) ).
tff(f_80,axiom,
implies(truth,x) != x,
file(unknown,unknown) ).
tff(c_4,plain,
! [X_2] : ( xor(X_2,falsehood) = X_2 ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_6,plain,
! [X_3] : ( xor(X_3,X_3) = falsehood ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_2,plain,
! [X_1] : ( xor(X_1,truth) = not(X_1) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_14,plain,
! [X_7,Y_8] : ( xor(xor(X_7,truth),Y_8) = xor(X_7,xor(truth,Y_8)) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_506,plain,
! [X_35,Y_36] : ( xor(not(X_35),Y_36) = xor(X_35,xor(truth,Y_36)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_14]) ).
tff(c_545,plain,
! [X_35] : ( xor(X_35,xor(truth,truth)) = not(not(X_35)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_506]) ).
tff(c_562,plain,
! [X_35] : ( not(not(X_35)) = X_35 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_6,c_545]) ).
tff(c_212,plain,
! [Y_28,X_29] : ( and_star(Y_28,X_29) = and_star(X_29,Y_28) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_8,plain,
! [X_4] : ( and_star(X_4,truth) = X_4 ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_232,plain,
! [Y_28] : ( and_star(truth,Y_28) = Y_28 ),
inference(superposition,[status(thm),theory(equality)],[c_212,c_8]) ).
tff(c_96,plain,
! [Y_25,X_26] : ( xor(Y_25,X_26) = xor(X_26,Y_25) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_116,plain,
! [Y_25] : ( xor(truth,Y_25) = not(Y_25) ),
inference(superposition,[status(thm),theory(equality)],[c_96,c_2]) ).
tff(c_26,plain,
! [X_18,Y_19] : ( xor(truth,and_star(X_18,xor(truth,Y_19))) = implies(X_18,Y_19) ),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_1570,plain,
! [X_58,Y_59] : ( not(and_star(X_58,not(Y_59))) = implies(X_58,Y_59) ),
inference(demodulation,[status(thm),theory(equality)],[c_116,c_116,c_26]) ).
tff(c_1645,plain,
! [Y_59] : ( not(not(Y_59)) = implies(truth,Y_59) ),
inference(superposition,[status(thm),theory(equality)],[c_232,c_1570]) ).
tff(c_1668,plain,
! [Y_59] : ( implies(truth,Y_59) = Y_59 ),
inference(demodulation,[status(thm),theory(equality)],[c_562,c_1645]) ).
tff(c_28,plain,
implies(truth,x) != x,
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_1673,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1668,c_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL161-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/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.17/0.35 % Computer : n008.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 14:15:04 EDT 2023
% 0.17/0.35 % CPUTime :
% 3.72/2.04 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.72/2.05
% 3.72/2.05 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.15/2.07
% 4.15/2.07 Inference rules
% 4.15/2.07 ----------------------
% 4.15/2.07 #Ref : 0
% 4.15/2.07 #Sup : 388
% 4.15/2.07 #Fact : 0
% 4.15/2.07 #Define : 0
% 4.15/2.07 #Split : 0
% 4.15/2.07 #Chain : 0
% 4.15/2.07 #Close : 0
% 4.15/2.07
% 4.15/2.07 Ordering : KBO
% 4.15/2.07
% 4.15/2.07 Simplification rules
% 4.15/2.07 ----------------------
% 4.15/2.07 #Subsume : 0
% 4.15/2.07 #Demod : 413
% 4.15/2.07 #Tautology : 284
% 4.15/2.07 #SimpNegUnit : 0
% 4.15/2.07 #BackRed : 4
% 4.15/2.07
% 4.15/2.07 #Partial instantiations: 0
% 4.15/2.08 #Strategies tried : 1
% 4.15/2.08
% 4.15/2.08 Timing (in seconds)
% 4.15/2.08 ----------------------
% 4.15/2.08 Preprocessing : 0.46
% 4.15/2.08 Parsing : 0.23
% 4.15/2.08 CNF conversion : 0.02
% 4.15/2.08 Main loop : 0.55
% 4.15/2.08 Inferencing : 0.18
% 4.15/2.08 Reduction : 0.23
% 4.15/2.08 Demodulation : 0.19
% 4.15/2.08 BG Simplification : 0.02
% 4.15/2.08 Subsumption : 0.08
% 4.15/2.08 Abstraction : 0.02
% 4.15/2.08 MUC search : 0.00
% 4.15/2.08 Cooper : 0.00
% 4.15/2.08 Total : 1.05
% 4.15/2.08 Index Insertion : 0.00
% 4.15/2.08 Index Deletion : 0.00
% 4.15/2.08 Index Matching : 0.00
% 4.15/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------