TSTP Solution File: COL002-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL002-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n032.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:46 EDT 2023
% Result : Unsatisfiable 3.93s 2.02s
% Output : CNFRefutation 4.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 18 ( 12 unt; 6 typ; 0 def)
% Number of atoms : 12 ( 11 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 : 5 ( 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 : 21 (; 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > s > i > fixed_pt > c > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(i,type,
i: $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(s,type,
s: $i ).
tff(fixed_pt,type,
fixed_pt: $i ).
tff(b,type,
b: $i ).
tff(c,type,
c: $i ).
tff(f_27,axiom,
! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X] : ( apply(i,X) = X ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [X,Y,Z] : ( apply(apply(apply(s,X),Y),Z) = apply(apply(X,Z),apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [Y] : ( Y != apply(fixed_pt,Y) ),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_4,Y_5,Z_6] : ( apply(apply(apply(b,X_4),Y_5),Z_6) = apply(X_4,apply(Y_5,Z_6)) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_8,plain,
! [X_10] : ( apply(i,X_10) = X_10 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_39,plain,
! [X_20,Y_21,Z_22] : ( apply(apply(apply(s,X_20),Y_21),Z_22) = apply(apply(X_20,Z_22),apply(Y_21,Z_22)) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_320,plain,
! [X_26,X_27] : ( apply(apply(apply(s,X_26),i),X_27) = apply(apply(X_26,X_27),X_27) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_39]) ).
tff(c_779,plain,
! [X_31,Z_32] : ( apply(apply(apply(s,apply(b,X_31)),i),Z_32) = apply(X_31,apply(Z_32,Z_32)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_320]) ).
tff(c_10,plain,
! [Y_11] : ( apply(fixed_pt,Y_11) != Y_11 ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_941,plain,
! [Z_32] : ( apply(apply(apply(s,apply(b,fixed_pt)),i),Z_32) != apply(Z_32,Z_32) ),
inference(superposition,[status(thm),theory(equality)],[c_779,c_10]) ).
tff(c_1635,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_941]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.32 % Computer : n032.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu Aug 3 18:17:21 EDT 2023
% 0.12/0.32 % CPUTime :
% 3.93/2.02 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.31/2.03
% 4.31/2.03 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.31/2.05
% 4.31/2.05 Inference rules
% 4.31/2.05 ----------------------
% 4.31/2.05 #Ref : 1
% 4.31/2.05 #Sup : 434
% 4.31/2.05 #Fact : 0
% 4.31/2.05 #Define : 0
% 4.31/2.05 #Split : 0
% 4.31/2.05 #Chain : 0
% 4.31/2.05 #Close : 0
% 4.31/2.05
% 4.31/2.05 Ordering : KBO
% 4.31/2.05
% 4.31/2.05 Simplification rules
% 4.31/2.05 ----------------------
% 4.31/2.05 #Subsume : 10
% 4.31/2.05 #Demod : 54
% 4.31/2.05 #Tautology : 73
% 4.31/2.05 #SimpNegUnit : 0
% 4.31/2.05 #BackRed : 0
% 4.31/2.05
% 4.31/2.05 #Partial instantiations: 0
% 4.31/2.05 #Strategies tried : 1
% 4.31/2.05
% 4.31/2.05 Timing (in seconds)
% 4.31/2.05 ----------------------
% 4.31/2.06 Preprocessing : 0.39
% 4.31/2.06 Parsing : 0.21
% 4.31/2.06 CNF conversion : 0.02
% 4.31/2.06 Main loop : 0.69
% 4.31/2.06 Inferencing : 0.26
% 4.31/2.06 Reduction : 0.25
% 4.31/2.06 Demodulation : 0.22
% 4.31/2.06 BG Simplification : 0.04
% 4.31/2.06 Subsumption : 0.10
% 4.31/2.06 Abstraction : 0.04
% 4.31/2.06 MUC search : 0.00
% 4.31/2.06 Cooper : 0.00
% 4.31/2.06 Total : 1.12
% 4.31/2.06 Index Insertion : 0.00
% 4.31/2.06 Index Deletion : 0.00
% 4.31/2.06 Index Matching : 0.00
% 4.31/2.06 BG Taut test : 0.00
%------------------------------------------------------------------------------