TSTP Solution File: CAT014-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT014-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/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 : n006.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:39 EDT 2023
% Result : Unsatisfiable 2.66s 1.67s
% Output : CNFRefutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 13 ( 9 unt; 4 typ; 0 def)
% Number of atoms : 9 ( 8 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 : 6 (; 6 !; 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_48,axiom,
! [X] : ( domain(codomain(X)) = codomain(X) ),
file(unknown,unknown) ).
tff(f_46,axiom,
! [X] : ( codomain(domain(X)) = domain(X) ),
file(unknown,unknown) ).
tff(f_74,axiom,
codomain(codomain(a)) != codomain(a),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_2] : ( domain(codomain(X_2)) = codomain(X_2) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_35,plain,
! [X_14] : ( codomain(domain(X_14)) = domain(X_14) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_50,plain,
! [X_2] : ( domain(codomain(X_2)) = codomain(codomain(X_2)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_35]) ).
tff(c_54,plain,
! [X_2] : ( codomain(codomain(X_2)) = codomain(X_2) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_50]) ).
tff(c_16,plain,
codomain(codomain(a)) != codomain(a),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_129,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_54,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : CAT014-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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 : n006.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 17:43:13 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.66/1.67 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.66/1.67
% 2.66/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.66/1.69
% 2.66/1.69 Inference rules
% 2.66/1.69 ----------------------
% 2.66/1.69 #Ref : 0
% 2.66/1.69 #Sup : 26
% 2.66/1.69 #Fact : 0
% 2.66/1.69 #Define : 0
% 2.66/1.69 #Split : 0
% 2.66/1.69 #Chain : 0
% 2.66/1.69 #Close : 0
% 2.66/1.69
% 2.66/1.69 Ordering : KBO
% 2.66/1.69
% 2.66/1.69 Simplification rules
% 2.66/1.69 ----------------------
% 2.66/1.69 #Subsume : 2
% 2.66/1.69 #Demod : 16
% 2.66/1.69 #Tautology : 18
% 2.66/1.69 #SimpNegUnit : 0
% 2.66/1.69 #BackRed : 1
% 2.66/1.69
% 2.66/1.69 #Partial instantiations: 0
% 2.66/1.69 #Strategies tried : 1
% 2.66/1.69
% 2.66/1.69 Timing (in seconds)
% 2.66/1.69 ----------------------
% 2.66/1.70 Preprocessing : 0.43
% 2.66/1.70 Parsing : 0.24
% 2.66/1.70 CNF conversion : 0.02
% 2.66/1.70 Main loop : 0.20
% 2.66/1.70 Inferencing : 0.08
% 2.66/1.70 Reduction : 0.05
% 2.66/1.70 Demodulation : 0.04
% 2.66/1.70 BG Simplification : 0.01
% 2.66/1.70 Subsumption : 0.04
% 2.66/1.70 Abstraction : 0.01
% 2.66/1.70 MUC search : 0.00
% 2.66/1.70 Cooper : 0.00
% 2.66/1.70 Total : 0.67
% 2.66/1.70 Index Insertion : 0.00
% 2.66/1.70 Index Deletion : 0.00
% 2.66/1.70 Index Matching : 0.00
% 2.66/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------