TSTP Solution File: SET016-7 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET016-7 : TPTP v8.1.2. Bugfixed v7.3.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 : 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:55:32 EDT 2023
% Result : Unsatisfiable 9.24s 3.12s
% Output : CNFRefutation 9.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 57
% Syntax : Number of formulae : 65 ( 8 unt; 53 typ; 0 def)
% Number of atoms : 18 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 9 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 67 ( 41 >; 26 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 44 ( 44 usr; 12 con; 0-3 aty)
% Number of variables : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ homomorphism > compatible > subclass > member > single_valued_class > operation > one_to_one > inductive > function > restrict > range > not_homomorphism2 > not_homomorphism1 > domain > unordered_pair > union > symmetric_difference > ordered_pair > not_subclass_element > intersection > image > cross_product > compose > apply > #nlpp > sum_class > successor > singleton > second > rotate > regular > range_of > power_class > member_of1 > member_of > inverse > flip > first > domain_of > diagonalise > complement > cantor > z > y > x > w > universal_class > successor_relation > subset_relation > omega > null_class > identity_relation > element_relation > choice
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(omega,type,
omega: $i ).
tff(null_class,type,
null_class: $i ).
tff(rotate,type,
rotate: $i > $i ).
tff(subclass,type,
subclass: ( $i * $i ) > $o ).
tff(singleton,type,
singleton: $i > $i ).
tff(single_valued_class,type,
single_valued_class: $i > $o ).
tff(operation,type,
operation: $i > $o ).
tff(sum_class,type,
sum_class: $i > $i ).
tff(x,type,
x: $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(compatible,type,
compatible: ( $i * $i * $i ) > $o ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(regular,type,
regular: $i > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff(one_to_one,type,
one_to_one: $i > $o ).
tff(w,type,
w: $i ).
tff(element_relation,type,
element_relation: $i ).
tff(intersection,type,
intersection: ( $i * $i ) > $i ).
tff(second,type,
second: $i > $i ).
tff(union,type,
union: ( $i * $i ) > $i ).
tff(function,type,
function: $i > $o ).
tff(symmetric_difference,type,
symmetric_difference: ( $i * $i ) > $i ).
tff(flip,type,
flip: $i > $i ).
tff(power_class,type,
power_class: $i > $i ).
tff(cross_product,type,
cross_product: ( $i * $i ) > $i ).
tff(choice,type,
choice: $i ).
tff(y,type,
y: $i ).
tff(subset_relation,type,
subset_relation: $i ).
tff(restrict,type,
restrict: ( $i * $i * $i ) > $i ).
tff(complement,type,
complement: $i > $i ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff(member_of1,type,
member_of1: $i > $i ).
tff(not_subclass_element,type,
not_subclass_element: ( $i * $i ) > $i ).
tff(member_of,type,
member_of: $i > $i ).
tff(range,type,
range: ( $i * $i * $i ) > $i ).
tff(first,type,
first: $i > $i ).
tff(diagonalise,type,
diagonalise: $i > $i ).
tff(homomorphism,type,
homomorphism: ( $i * $i * $i ) > $o ).
tff(cantor,type,
cantor: $i > $i ).
tff(image,type,
image: ( $i * $i ) > $i ).
tff(range_of,type,
range_of: $i > $i ).
tff(inductive,type,
inductive: $i > $o ).
tff(domain,type,
domain: ( $i * $i * $i ) > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(domain_of,type,
domain_of: $i > $i ).
tff(z,type,
z: $i ).
tff(not_homomorphism2,type,
not_homomorphism2: ( $i * $i * $i ) > $i ).
tff(successor,type,
successor: $i > $i ).
tff(successor_relation,type,
successor_relation: $i ).
tff(identity_relation,type,
identity_relation: $i ).
tff(not_homomorphism1,type,
not_homomorphism1: ( $i * $i * $i ) > $i ).
tff(universal_class,type,
universal_class: $i ).
tff(f_1099,axiom,
w != y,
file(unknown,unknown) ).
tff(f_1093,axiom,
ordered_pair(w,x) = ordered_pair(y,z),
file(unknown,unknown) ).
tff(f_1094,axiom,
member(w,universal_class),
file(unknown,unknown) ).
tff(f_1011,axiom,
! [W,X,Y,Z] :
( ( ordered_pair(W,X) != ordered_pair(Y,Z) )
| ~ member(W,universal_class)
| ( W = Y ) ),
file(unknown,unknown) ).
tff(c_336,plain,
y != w,
inference(cnfTransformation,[status(thm)],[f_1099]) ).
tff(c_332,plain,
ordered_pair(y,z) = ordered_pair(w,x),
inference(cnfTransformation,[status(thm)],[f_1093]) ).
tff(c_334,plain,
member(w,universal_class),
inference(cnfTransformation,[status(thm)],[f_1094]) ).
tff(c_4997,plain,
! [Y_605,W_606,Z_607,X_608] :
( ( Y_605 = W_606 )
| ~ member(W_606,universal_class)
| ( ordered_pair(Y_605,Z_607) != ordered_pair(W_606,X_608) ) ),
inference(cnfTransformation,[status(thm)],[f_1011]) ).
tff(c_5180,plain,
! [Y_617,X_618,Z_619] :
( ( w = Y_617 )
| ( ordered_pair(w,X_618) != ordered_pair(Y_617,Z_619) ) ),
inference(resolution,[status(thm)],[c_334,c_4997]) ).
tff(c_5189,plain,
! [X_618] :
( ( y = w )
| ( ordered_pair(w,x) != ordered_pair(w,X_618) ) ),
inference(superposition,[status(thm),theory(equality)],[c_332,c_5180]) ).
tff(c_5190,plain,
! [X_618] : ( ordered_pair(w,x) != ordered_pair(w,X_618) ),
inference(negUnitSimplification,[status(thm)],[c_336,c_5189]) ).
tff(c_5253,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_5190]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET016-7 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.00/0.14 % 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 : n015.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:19:59 EDT 2023
% 0.14/0.36 % CPUTime :
% 9.24/3.12 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.24/3.13
% 9.24/3.13 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.24/3.15
% 9.24/3.15 Inference rules
% 9.24/3.15 ----------------------
% 9.24/3.15 #Ref : 8
% 9.24/3.15 #Sup : 1266
% 9.24/3.15 #Fact : 2
% 9.24/3.15 #Define : 0
% 9.24/3.15 #Split : 16
% 9.24/3.15 #Chain : 0
% 9.24/3.15 #Close : 0
% 9.24/3.15
% 9.24/3.15 Ordering : KBO
% 9.24/3.15
% 9.24/3.15 Simplification rules
% 9.24/3.15 ----------------------
% 9.24/3.15 #Subsume : 239
% 9.24/3.15 #Demod : 205
% 9.24/3.15 #Tautology : 284
% 9.24/3.15 #SimpNegUnit : 12
% 9.24/3.15 #BackRed : 7
% 9.24/3.15
% 9.24/3.15 #Partial instantiations: 0
% 9.24/3.15 #Strategies tried : 1
% 9.24/3.15
% 9.24/3.15 Timing (in seconds)
% 9.24/3.15 ----------------------
% 9.24/3.16 Preprocessing : 0.80
% 9.24/3.16 Parsing : 0.36
% 9.24/3.16 CNF conversion : 0.06
% 9.24/3.16 Main loop : 1.29
% 9.24/3.16 Inferencing : 0.42
% 9.24/3.16 Reduction : 0.44
% 9.24/3.16 Demodulation : 0.31
% 9.24/3.16 BG Simplification : 0.07
% 9.24/3.16 Subsumption : 0.28
% 9.24/3.16 Abstraction : 0.04
% 9.24/3.16 MUC search : 0.00
% 9.24/3.16 Cooper : 0.00
% 9.24/3.16 Total : 2.14
% 9.24/3.16 Index Insertion : 0.00
% 9.24/3.16 Index Deletion : 0.00
% 9.24/3.16 Index Matching : 0.00
% 9.24/3.16 BG Taut test : 0.00
%------------------------------------------------------------------------------