TSTP Solution File: LDA007-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LDA007-2 : TPTP v8.1.2. Bugfixed v2.6.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 : n027.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:49:21 EDT 2023
% Result : Unsatisfiable 6.03s 2.61s
% Output : CNFRefutation 6.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 23
% Syntax : Number of formulae : 37 ( 21 unt; 16 typ; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 12 con; 0-2 aty)
% Number of variables : 8 (; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > f > a > #nlpp > critical_point > ttk > tt_ts > tt > tsk > ts > tk > t > stk > st > sk > s > k
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(tsk,type,
tsk: $i ).
tff(t,type,
t: $i ).
tff(ttk,type,
ttk: $i ).
tff(tt_ts,type,
tt_ts: $i ).
tff(s,type,
s: $i ).
tff(sk,type,
sk: $i ).
tff(st,type,
st: $i ).
tff(k,type,
k: $i ).
tff(critical_point,type,
critical_point: $i > $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(a,type,
a: ( $i * $i ) > $i ).
tff(stk,type,
stk: $i ).
tff(ts,type,
ts: $i ).
tff(tt,type,
tt: $i ).
tff(tk,type,
tk: $i ).
tff(f,type,
f: ( $i * $i ) > $i ).
tff(f_79,axiom,
f(t,tsk) != f(tt_ts,tk),
file(unknown,unknown) ).
tff(f_75,axiom,
tsk = f(ts,k),
file(unknown,unknown) ).
tff(f_69,axiom,
ts = f(t,s),
file(unknown,unknown) ).
tff(f_70,axiom,
tt_ts = f(tt,ts),
file(unknown,unknown) ).
tff(f_67,axiom,
tt = f(t,t),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X,Y,Z] : ( f(X,f(Y,Z)) = f(f(X,Y),f(X,Z)) ),
file(unknown,unknown) ).
tff(f_73,axiom,
tk = f(t,k),
file(unknown,unknown) ).
tff(c_40,plain,
f(tt_ts,tk) != f(t,tsk),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_36,plain,
f(ts,k) = tsk,
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_24,plain,
f(t,s) = ts,
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_26,plain,
f(tt,ts) = tt_ts,
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_20,plain,
f(t,t) = tt,
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_550,plain,
! [X_49,Y_50,Z_51] : ( f(f(X_49,Y_50),f(X_49,Z_51)) = f(X_49,f(Y_50,Z_51)) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_1130,plain,
! [Z_73] : ( f(tt,f(t,Z_73)) = f(t,f(t,Z_73)) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_550]) ).
tff(c_1157,plain,
f(t,f(t,s)) = f(tt,ts),
inference(superposition,[status(thm),theory(equality)],[c_24,c_1130]) ).
tff(c_1162,plain,
f(t,ts) = tt_ts,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_26,c_1157]) ).
tff(c_32,plain,
f(t,k) = tk,
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_2798,plain,
! [Y_97] : ( f(f(t,Y_97),tk) = f(t,f(Y_97,k)) ),
inference(superposition,[status(thm),theory(equality)],[c_32,c_550]) ).
tff(c_2843,plain,
f(t,f(ts,k)) = f(tt_ts,tk),
inference(superposition,[status(thm),theory(equality)],[c_1162,c_2798]) ).
tff(c_2855,plain,
f(tt_ts,tk) = f(t,tsk),
inference(demodulation,[status(thm),theory(equality)],[c_36,c_2843]) ).
tff(c_2857,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_40,c_2855]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LDA007-2 : TPTP v8.1.2. Bugfixed v2.6.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 : n027.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 18:15:24 EDT 2023
% 0.13/0.34 % CPUTime :
% 6.03/2.61 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.03/2.61
% 6.03/2.61 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.31/2.64
% 6.31/2.64 Inference rules
% 6.31/2.64 ----------------------
% 6.31/2.64 #Ref : 0
% 6.31/2.64 #Sup : 837
% 6.31/2.64 #Fact : 0
% 6.31/2.64 #Define : 0
% 6.31/2.64 #Split : 2
% 6.31/2.64 #Chain : 0
% 6.31/2.64 #Close : 0
% 6.31/2.64
% 6.31/2.64 Ordering : KBO
% 6.31/2.64
% 6.31/2.64 Simplification rules
% 6.31/2.64 ----------------------
% 6.31/2.64 #Subsume : 41
% 6.31/2.64 #Demod : 178
% 6.31/2.64 #Tautology : 224
% 6.31/2.64 #SimpNegUnit : 42
% 6.31/2.64 #BackRed : 5
% 6.31/2.64
% 6.31/2.64 #Partial instantiations: 0
% 6.31/2.64 #Strategies tried : 1
% 6.31/2.64
% 6.31/2.64 Timing (in seconds)
% 6.31/2.64 ----------------------
% 6.31/2.65 Preprocessing : 0.50
% 6.31/2.65 Parsing : 0.27
% 6.31/2.65 CNF conversion : 0.03
% 6.31/2.65 Main loop : 1.06
% 6.31/2.65 Inferencing : 0.41
% 6.31/2.65 Reduction : 0.35
% 6.31/2.65 Demodulation : 0.25
% 6.31/2.65 BG Simplification : 0.04
% 6.31/2.65 Subsumption : 0.17
% 6.31/2.65 Abstraction : 0.04
% 6.31/2.65 MUC search : 0.00
% 6.31/2.65 Cooper : 0.00
% 6.31/2.65 Total : 1.61
% 6.31/2.65 Index Insertion : 0.00
% 6.31/2.65 Index Deletion : 0.00
% 6.31/2.65 Index Matching : 0.00
% 6.31/2.65 BG Taut test : 0.00
%------------------------------------------------------------------------------