TSTP Solution File: CAT011-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT011-2 : 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/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 : n015.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:38 EDT 2023
% Result : Unsatisfiable 2.70s 1.82s
% Output : CNFRefutation 2.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 14 ( 10 unt; 4 typ; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ compose > #nlpp > domain > codomain > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(domain,type,
domain: $i > $i ).
tff(codomain,type,
codomain: $i > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(f_46,axiom,
! [X] : ( codomain(domain(X)) = domain(X) ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X] : ( domain(codomain(X)) = codomain(X) ),
file(unknown,unknown) ).
tff(f_74,axiom,
domain(domain(a)) != domain(a),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1] : ( codomain(domain(X_1)) = domain(X_1) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_35,plain,
! [X_14] : ( codomain(domain(X_14)) = domain(X_14) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_4,plain,
! [X_2] : ( domain(codomain(X_2)) = codomain(X_2) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_41,plain,
! [X_14] : ( domain(domain(X_14)) = codomain(domain(X_14)) ),
inference(superposition,[status(thm),theory(equality)],[c_35,c_4]) ).
tff(c_52,plain,
! [X_14] : ( domain(domain(X_14)) = domain(X_14) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_41]) ).
tff(c_16,plain,
domain(domain(a)) != domain(a),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_96,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_52,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CAT011-2 : TPTP v8.1.2. Released v1.0.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.13/0.34 % Computer : n015.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:07:59 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.70/1.82 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.70/1.82
% 2.70/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.93/1.85
% 2.93/1.85 Inference rules
% 2.93/1.85 ----------------------
% 2.93/1.85 #Ref : 0
% 2.93/1.85 #Sup : 18
% 2.93/1.85 #Fact : 0
% 2.93/1.85 #Define : 0
% 2.93/1.85 #Split : 0
% 2.93/1.85 #Chain : 0
% 2.93/1.85 #Close : 0
% 2.93/1.85
% 2.93/1.85 Ordering : KBO
% 2.93/1.85
% 2.93/1.85 Simplification rules
% 2.93/1.85 ----------------------
% 2.93/1.85 #Subsume : 1
% 2.93/1.85 #Demod : 6
% 2.93/1.85 #Tautology : 11
% 2.93/1.85 #SimpNegUnit : 0
% 2.93/1.85 #BackRed : 1
% 2.93/1.85
% 2.93/1.85 #Partial instantiations: 0
% 2.93/1.85 #Strategies tried : 1
% 2.93/1.85
% 2.93/1.85 Timing (in seconds)
% 2.93/1.85 ----------------------
% 2.93/1.85 Preprocessing : 0.47
% 2.93/1.85 Parsing : 0.26
% 2.93/1.85 CNF conversion : 0.02
% 2.93/1.85 Main loop : 0.23
% 2.93/1.86 Inferencing : 0.10
% 2.93/1.86 Reduction : 0.06
% 2.93/1.86 Demodulation : 0.04
% 2.93/1.86 BG Simplification : 0.01
% 2.93/1.86 Subsumption : 0.05
% 2.93/1.86 Abstraction : 0.01
% 2.93/1.86 MUC search : 0.00
% 2.93/1.86 Cooper : 0.00
% 2.93/1.86 Total : 0.75
% 2.93/1.86 Index Insertion : 0.00
% 2.93/1.86 Index Deletion : 0.00
% 2.93/1.86 Index Matching : 0.00
% 2.93/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------