TSTP Solution File: COL018-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL018-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 : n019.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:50 EDT 2023
% Result : Unsatisfiable 2.58s 1.65s
% Output : CNFRefutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 11 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 6 ( 5 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 avg)
% Maximal term depth : 3 ( 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > w > q > l > combinator
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(l,type,
l: $i ).
tff(w,type,
w: $i ).
tff(combinator,type,
combinator: $i ).
tff(q,type,
q: $i ).
tff(f_28,axiom,
! [X,Y] : ( apply(apply(l,X),Y) = apply(X,apply(Y,Y)) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [Y] : ( Y != apply(combinator,Y) ),
file(unknown,unknown) ).
tff(c_10,plain,
! [X_10,Y_11] : ( apply(apply(l,X_10),Y_11) = apply(X_10,apply(Y_11,Y_11)) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_8,plain,
! [Y_8] : ( apply(combinator,Y_8) != Y_8 ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_28,plain,
! [Y_11] : ( apply(apply(l,combinator),Y_11) != apply(Y_11,Y_11) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_8]) ).
tff(c_50,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : COL018-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % 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.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 18:10:46 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.58/1.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.58/1.65
% 2.58/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.58/1.68
% 2.58/1.68 Inference rules
% 2.58/1.68 ----------------------
% 2.58/1.68 #Ref : 1
% 2.58/1.68 #Sup : 9
% 2.58/1.68 #Fact : 0
% 2.58/1.68 #Define : 0
% 2.58/1.68 #Split : 0
% 2.58/1.68 #Chain : 0
% 2.58/1.68 #Close : 0
% 2.58/1.68
% 2.58/1.68 Ordering : KBO
% 2.58/1.68
% 2.58/1.68 Simplification rules
% 2.58/1.68 ----------------------
% 2.58/1.68 #Subsume : 0
% 2.58/1.68 #Demod : 0
% 2.58/1.68 #Tautology : 4
% 2.58/1.68 #SimpNegUnit : 0
% 2.58/1.68 #BackRed : 0
% 2.58/1.68
% 2.58/1.68 #Partial instantiations: 0
% 2.58/1.68 #Strategies tried : 1
% 2.58/1.68
% 2.58/1.68 Timing (in seconds)
% 2.58/1.68 ----------------------
% 2.58/1.69 Preprocessing : 0.40
% 2.58/1.69 Parsing : 0.21
% 2.58/1.69 CNF conversion : 0.02
% 2.58/1.69 Main loop : 0.14
% 2.58/1.69 Inferencing : 0.06
% 2.58/1.69 Reduction : 0.03
% 2.58/1.69 Demodulation : 0.03
% 2.58/1.69 BG Simplification : 0.01
% 2.58/1.69 Subsumption : 0.03
% 2.58/1.69 Abstraction : 0.01
% 2.58/1.69 MUC search : 0.00
% 2.58/1.69 Cooper : 0.00
% 2.58/1.69 Total : 0.59
% 2.58/1.69 Index Insertion : 0.00
% 2.58/1.69 Index Deletion : 0.00
% 2.58/1.69 Index Matching : 0.00
% 2.58/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------