TSTP Solution File: CAT007-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CAT007-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/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 : n017.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:37 EDT 2023
% Result : Unsatisfiable 2.73s 1.72s
% Output : CNFRefutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of formulae : 19 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 6 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 4 (; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equalish > there_exists > f1 > compose > #nlpp > domain > codomain > c2 > c1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c1,type,
c1: $i ).
tff(domain,type,
domain: $i > $i ).
tff(there_exists,type,
there_exists: $i > $o ).
tff(c2,type,
c2: $i ).
tff(codomain,type,
codomain: $i > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(f1,type,
f1: ( $i * $i ) > $i ).
tff(f_78,axiom,
~ there_exists(compose(c2,c1)),
file(unknown,unknown) ).
tff(f_74,axiom,
there_exists(domain(c2)),
file(unknown,unknown) ).
tff(f_76,axiom,
equalish(domain(c2),codomain(c1)),
file(unknown,unknown) ).
tff(f_54,axiom,
! [X,Y] :
( ~ there_exists(domain(X))
| ~ equalish(domain(X),codomain(Y))
| there_exists(compose(X,Y)) ),
file(unknown,unknown) ).
tff(c_24,plain,
~ there_exists(compose(c2,c1)),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_18,plain,
there_exists(domain(c2)),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_22,plain,
equalish(domain(c2),codomain(c1)),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_91,plain,
! [X_28,Y_29] :
( there_exists(compose(X_28,Y_29))
| ~ equalish(domain(X_28),codomain(Y_29))
| ~ there_exists(domain(X_28)) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_94,plain,
( there_exists(compose(c2,c1))
| ~ there_exists(domain(c2)) ),
inference(resolution,[status(thm)],[c_22,c_91]) ).
tff(c_97,plain,
there_exists(compose(c2,c1)),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_94]) ).
tff(c_99,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_24,c_97]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : CAT007-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/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 : n017.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:14:21 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.73/1.72 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.73/1.72
% 2.73/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.73/1.75
% 2.73/1.75 Inference rules
% 2.73/1.75 ----------------------
% 2.73/1.75 #Ref : 0
% 2.73/1.75 #Sup : 16
% 2.73/1.75 #Fact : 0
% 2.73/1.75 #Define : 0
% 2.73/1.75 #Split : 0
% 2.73/1.75 #Chain : 0
% 2.73/1.75 #Close : 0
% 2.73/1.75
% 2.73/1.75 Ordering : KBO
% 2.73/1.75
% 2.73/1.75 Simplification rules
% 2.73/1.75 ----------------------
% 2.73/1.75 #Subsume : 0
% 2.73/1.75 #Demod : 7
% 2.73/1.75 #Tautology : 8
% 2.73/1.75 #SimpNegUnit : 1
% 2.73/1.75 #BackRed : 0
% 2.73/1.75
% 2.73/1.75 #Partial instantiations: 0
% 2.73/1.75 #Strategies tried : 1
% 2.73/1.75
% 2.73/1.75 Timing (in seconds)
% 2.73/1.75 ----------------------
% 2.73/1.75 Preprocessing : 0.41
% 2.73/1.75 Parsing : 0.23
% 2.73/1.75 CNF conversion : 0.02
% 2.73/1.75 Main loop : 0.22
% 2.73/1.75 Inferencing : 0.09
% 2.73/1.75 Reduction : 0.05
% 2.73/1.75 Demodulation : 0.04
% 2.73/1.75 BG Simplification : 0.01
% 2.73/1.75 Subsumption : 0.05
% 2.73/1.75 Abstraction : 0.01
% 2.73/1.75 MUC search : 0.00
% 2.73/1.75 Cooper : 0.00
% 2.73/1.75 Total : 0.67
% 2.73/1.75 Index Insertion : 0.00
% 2.73/1.75 Index Deletion : 0.00
% 2.73/1.75 Index Matching : 0.00
% 2.73/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------