TSTP Solution File: LDA007-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LDA007-1 : 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 : n023.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:20 EDT 2023
% Result : Unsatisfiable 5.19s 2.27s
% Output : CNFRefutation 5.19s
% 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_113,axiom,
f(t,tsk) != f(tt_ts,tk),
file(unknown,unknown) ).
tff(f_109,axiom,
tsk = f(ts,k),
file(unknown,unknown) ).
tff(f_103,axiom,
ts = f(t,s),
file(unknown,unknown) ).
tff(f_104,axiom,
tt_ts = f(tt,ts),
file(unknown,unknown) ).
tff(f_101,axiom,
tt = f(t,t),
file(unknown,unknown) ).
tff(f_55,axiom,
! [X,Y,Z] : ( f(X,f(Y,Z)) = f(f(X,Y),f(X,Z)) ),
file(unknown,unknown) ).
tff(f_107,axiom,
tk = f(t,k),
file(unknown,unknown) ).
tff(c_40,plain,
f(tt_ts,tk) != f(t,tsk),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_36,plain,
f(ts,k) = tsk,
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_24,plain,
f(t,s) = ts,
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_26,plain,
f(tt,ts) = tt_ts,
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_20,plain,
f(t,t) = tt,
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_355,plain,
! [X_44,Y_45,Z_46] : ( f(f(X_44,Y_45),f(X_44,Z_46)) = f(X_44,f(Y_45,Z_46)) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_1705,plain,
! [Y_79] : ( f(f(t,Y_79),ts) = f(t,f(Y_79,s)) ),
inference(superposition,[status(thm),theory(equality)],[c_24,c_355]) ).
tff(c_1732,plain,
f(t,f(t,s)) = f(tt,ts),
inference(superposition,[status(thm),theory(equality)],[c_20,c_1705]) ).
tff(c_1741,plain,
f(t,ts) = tt_ts,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_26,c_1732]) ).
tff(c_32,plain,
f(t,k) = tk,
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_409,plain,
! [Y_45] : ( f(f(t,Y_45),tk) = f(t,f(Y_45,k)) ),
inference(superposition,[status(thm),theory(equality)],[c_32,c_355]) ).
tff(c_1752,plain,
f(t,f(ts,k)) = f(tt_ts,tk),
inference(superposition,[status(thm),theory(equality)],[c_1741,c_409]) ).
tff(c_1767,plain,
f(tt_ts,tk) = f(t,tsk),
inference(demodulation,[status(thm),theory(equality)],[c_36,c_1752]) ).
tff(c_1769,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_40,c_1767]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.15 % Problem : LDA007-1 : TPTP v8.1.2. Bugfixed v2.6.0.
% 0.14/0.15 % 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.16/0.37 % Computer : n023.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 18:10:52 EDT 2023
% 0.16/0.37 % CPUTime :
% 5.19/2.27 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.19/2.28
% 5.19/2.28 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.19/2.31
% 5.19/2.31 Inference rules
% 5.19/2.31 ----------------------
% 5.19/2.31 #Ref : 0
% 5.19/2.31 #Sup : 495
% 5.19/2.31 #Fact : 2
% 5.19/2.31 #Define : 0
% 5.19/2.31 #Split : 1
% 5.19/2.31 #Chain : 0
% 5.19/2.31 #Close : 0
% 5.19/2.31
% 5.19/2.31 Ordering : KBO
% 5.19/2.31
% 5.19/2.31 Simplification rules
% 5.19/2.31 ----------------------
% 5.19/2.31 #Subsume : 11
% 5.19/2.31 #Demod : 99
% 5.19/2.31 #Tautology : 165
% 5.19/2.31 #SimpNegUnit : 12
% 5.19/2.31 #BackRed : 1
% 5.19/2.31
% 5.19/2.31 #Partial instantiations: 0
% 5.19/2.31 #Strategies tried : 1
% 5.19/2.31
% 5.19/2.31 Timing (in seconds)
% 5.19/2.31 ----------------------
% 5.19/2.31 Preprocessing : 0.50
% 5.19/2.31 Parsing : 0.24
% 5.19/2.31 CNF conversion : 0.02
% 5.19/2.31 Main loop : 0.71
% 5.19/2.31 Inferencing : 0.28
% 5.19/2.31 Reduction : 0.23
% 5.19/2.31 Demodulation : 0.16
% 5.19/2.31 BG Simplification : 0.03
% 5.19/2.31 Subsumption : 0.12
% 5.19/2.31 Abstraction : 0.03
% 5.19/2.31 MUC search : 0.00
% 5.19/2.31 Cooper : 0.00
% 5.19/2.31 Total : 1.26
% 5.19/2.31 Index Insertion : 0.00
% 5.19/2.31 Index Deletion : 0.00
% 5.19/2.31 Index Matching : 0.00
% 5.19/2.31 BG Taut test : 0.00
%------------------------------------------------------------------------------