TSTP Solution File: CAT012-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT012-4 : 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 : n029.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.83s 1.71s
% Output : CNFRefutation 3.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 20 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 19 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equivalent > there_exists > 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(f_108,axiom,
there_exists(domain(a)),
file(unknown,unknown) ).
tff(f_76,axiom,
! [X] :
( ~ there_exists(domain(X))
| there_exists(X) ),
file(unknown,unknown) ).
tff(f_103,axiom,
! [X] : ( compose(X,domain(X)) = X ),
file(unknown,unknown) ).
tff(f_91,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) ),
file(unknown,unknown) ).
tff(f_110,axiom,
codomain(domain(a)) != domain(a),
file(unknown,unknown) ).
tff(c_24,plain,
there_exists(domain(a)),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_49,plain,
! [X_27] :
( there_exists(X_27)
| ~ there_exists(domain(X_27)) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_53,plain,
there_exists(a),
inference(resolution,[status(thm)],[c_24,c_49]) ).
tff(c_20,plain,
! [X_18] : ( compose(X_18,domain(X_18)) = X_18 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_85,plain,
! [X_34,Y_35] :
( ( domain(X_34) = codomain(Y_35) )
| ~ there_exists(compose(X_34,Y_35)) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_150,plain,
! [X_40] :
( ( codomain(domain(X_40)) = domain(X_40) )
| ~ there_exists(X_40) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_85]) ).
tff(c_26,plain,
codomain(domain(a)) != domain(a),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_171,plain,
~ there_exists(a),
inference(superposition,[status(thm),theory(equality)],[c_150,c_26]) ).
tff(c_182,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_53,c_171]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CAT012-4 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n029.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:06:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.83/1.71 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.09/1.71
% 3.09/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.09/1.74
% 3.09/1.74 Inference rules
% 3.09/1.74 ----------------------
% 3.09/1.74 #Ref : 0
% 3.09/1.74 #Sup : 39
% 3.09/1.74 #Fact : 0
% 3.09/1.74 #Define : 0
% 3.09/1.74 #Split : 0
% 3.09/1.74 #Chain : 0
% 3.09/1.74 #Close : 0
% 3.09/1.74
% 3.09/1.74 Ordering : KBO
% 3.09/1.74
% 3.09/1.74 Simplification rules
% 3.09/1.74 ----------------------
% 3.09/1.74 #Subsume : 6
% 3.09/1.74 #Demod : 7
% 3.09/1.74 #Tautology : 15
% 3.09/1.74 #SimpNegUnit : 0
% 3.09/1.74 #BackRed : 0
% 3.09/1.74
% 3.09/1.74 #Partial instantiations: 0
% 3.09/1.74 #Strategies tried : 1
% 3.09/1.74
% 3.09/1.74 Timing (in seconds)
% 3.09/1.74 ----------------------
% 3.09/1.74 Preprocessing : 0.45
% 3.09/1.74 Parsing : 0.23
% 3.09/1.74 CNF conversion : 0.02
% 3.09/1.74 Main loop : 0.25
% 3.09/1.74 Inferencing : 0.10
% 3.09/1.74 Reduction : 0.07
% 3.09/1.74 Demodulation : 0.05
% 3.09/1.74 BG Simplification : 0.01
% 3.09/1.74 Subsumption : 0.05
% 3.09/1.74 Abstraction : 0.01
% 3.09/1.74 MUC search : 0.00
% 3.09/1.74 Cooper : 0.00
% 3.09/1.74 Total : 0.74
% 3.09/1.74 Index Insertion : 0.00
% 3.09/1.74 Index Deletion : 0.00
% 3.09/1.74 Index Matching : 0.00
% 3.09/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------