TSTP Solution File: COL060-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL060-3 : TPTP v8.1.2. Bugfixed v1.2.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 : n029.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:34:56 EDT 2023
% Result : Unsatisfiable 2.06s 1.40s
% Output : CNFRefutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of formulae : 14 ( 8 unt; 6 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > z > y > x > t > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(t,type,
t: $i ).
tff(x,type,
x: $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(y,type,
y: $i ).
tff(z,type,
z: $i ).
tff(f_28,axiom,
! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [X,Y] : ( apply(apply(t,X),Y) = apply(Y,X) ),
file(unknown,unknown) ).
tff(f_33,axiom,
apply(apply(apply(apply(apply(b,apply(apply(b,apply(t,b)),b)),t),x),y),z) != apply(y,apply(x,z)),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] : ( apply(apply(apply(b,X_1),Y_2),Z_3) = apply(X_1,apply(Y_2,Z_3)) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_4,plain,
! [X_4,Y_5] : ( apply(apply(t,X_4),Y_5) = apply(Y_5,X_4) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_6,plain,
apply(apply(apply(apply(apply(b,apply(apply(b,apply(t,b)),b)),t),x),y),z) != apply(y,apply(x,z)),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_7,plain,
apply(apply(apply(apply(t,b),apply(b,apply(t,x))),y),z) != apply(y,apply(x,z)),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_6]) ).
tff(c_9,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_4,c_2,c_4,c_7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL060-3 : TPTP v8.1.2. Bugfixed v1.2.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 : n029.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 18:32:07 EDT 2023
% 0.17/0.36 % CPUTime :
% 2.06/1.40 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.06/1.40
% 2.06/1.40 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.06/1.44
% 2.06/1.44 Inference rules
% 2.06/1.44 ----------------------
% 2.06/1.44 #Ref : 0
% 2.06/1.44 #Sup : 0
% 2.06/1.44 #Fact : 0
% 2.06/1.44 #Define : 0
% 2.06/1.44 #Split : 0
% 2.06/1.44 #Chain : 0
% 2.06/1.44 #Close : 0
% 2.06/1.44
% 2.06/1.44 Ordering : KBO
% 2.06/1.44
% 2.06/1.44 Simplification rules
% 2.06/1.44 ----------------------
% 2.06/1.44 #Subsume : 2
% 2.06/1.44 #Demod : 6
% 2.06/1.44 #Tautology : 0
% 2.06/1.44 #SimpNegUnit : 0
% 2.06/1.44 #BackRed : 0
% 2.06/1.44
% 2.06/1.44 #Partial instantiations: 0
% 2.06/1.44 #Strategies tried : 1
% 2.06/1.44
% 2.06/1.44 Timing (in seconds)
% 2.06/1.44 ----------------------
% 2.06/1.44 Preprocessing : 0.40
% 2.06/1.44 Parsing : 0.21
% 2.06/1.44 CNF conversion : 0.02
% 2.06/1.44 Main loop : 0.06
% 2.06/1.44 Inferencing : 0.00
% 2.06/1.45 Reduction : 0.04
% 2.06/1.45 Demodulation : 0.03
% 2.06/1.45 BG Simplification : 0.01
% 2.06/1.45 Subsumption : 0.02
% 2.06/1.45 Abstraction : 0.01
% 2.06/1.45 MUC search : 0.00
% 2.06/1.45 Cooper : 0.00
% 2.06/1.45 Total : 0.52
% 2.06/1.45 Index Insertion : 0.00
% 2.06/1.45 Index Deletion : 0.00
% 2.06/1.45 Index Matching : 0.00
% 2.06/1.45 BG Taut test : 0.00
%------------------------------------------------------------------------------