TSTP Solution File: CAT017-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT017-3 : 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 : n020.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:40 EDT 2023
% Result : Unsatisfiable 2.88s 1.70s
% Output : CNFRefutation 3.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 18 ( 8 unt; 7 typ; 0 def)
% Number of atoms : 14 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 6 ~; 3 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 6 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equivalent > there_exists > f1 > compose > #nlpp > domain > codomain > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(equivalent,type,
equivalent: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(domain,type,
domain: $i > $i ).
tff(there_exists,type,
there_exists: $i > $o ).
tff(codomain,type,
codomain: $i > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(f1,type,
f1: ( $i * $i ) > $i ).
tff(f_157,axiom,
there_exists(a),
file(unknown,unknown) ).
tff(f_103,axiom,
! [X] : ( compose(X,domain(X)) = X ),
file(unknown,unknown) ).
tff(f_129,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| there_exists(codomain(X)) ),
file(unknown,unknown) ).
tff(f_159,axiom,
~ there_exists(codomain(a)),
file(unknown,unknown) ).
tff(c_36,plain,
there_exists(a),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_20,plain,
! [X_18] : ( compose(X_18,domain(X_18)) = X_18 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_77,plain,
! [X_45,Y_46] :
( there_exists(codomain(X_45))
| ~ there_exists(compose(X_45,Y_46)) ),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_84,plain,
! [X_47] :
( there_exists(codomain(X_47))
| ~ there_exists(X_47) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_77]) ).
tff(c_38,plain,
~ there_exists(codomain(a)),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_90,plain,
~ there_exists(a),
inference(resolution,[status(thm)],[c_84,c_38]) ).
tff(c_95,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_36,c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : CAT017-3 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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.15/0.37 % Computer : n020.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 17:48:37 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.88/1.70 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.88/1.71
% 2.88/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.11/1.73
% 3.11/1.73 Inference rules
% 3.11/1.73 ----------------------
% 3.11/1.73 #Ref : 0
% 3.11/1.73 #Sup : 11
% 3.11/1.73 #Fact : 0
% 3.11/1.73 #Define : 0
% 3.11/1.73 #Split : 0
% 3.11/1.73 #Chain : 0
% 3.11/1.73 #Close : 0
% 3.11/1.73
% 3.11/1.73 Ordering : KBO
% 3.11/1.73
% 3.11/1.73 Simplification rules
% 3.11/1.73 ----------------------
% 3.11/1.73 #Subsume : 1
% 3.11/1.73 #Demod : 1
% 3.11/1.73 #Tautology : 8
% 3.11/1.73 #SimpNegUnit : 0
% 3.11/1.73 #BackRed : 0
% 3.11/1.73
% 3.11/1.73 #Partial instantiations: 0
% 3.11/1.73 #Strategies tried : 1
% 3.11/1.73
% 3.11/1.73 Timing (in seconds)
% 3.11/1.73 ----------------------
% 3.11/1.74 Preprocessing : 0.47
% 3.11/1.74 Parsing : 0.25
% 3.11/1.74 CNF conversion : 0.03
% 3.11/1.74 Main loop : 0.19
% 3.11/1.74 Inferencing : 0.07
% 3.11/1.74 Reduction : 0.05
% 3.11/1.74 Demodulation : 0.03
% 3.11/1.74 BG Simplification : 0.01
% 3.11/1.74 Subsumption : 0.04
% 3.11/1.74 Abstraction : 0.01
% 3.11/1.74 MUC search : 0.00
% 3.11/1.74 Cooper : 0.00
% 3.11/1.74 Total : 0.70
% 3.11/1.74 Index Insertion : 0.00
% 3.11/1.74 Index Deletion : 0.00
% 3.11/1.74 Index Matching : 0.00
% 3.11/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------