TSTP Solution File: SET093-7 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET093-7 : TPTP v8.1.2. Bugfixed v2.1.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 : n023.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:56 EDT 2023
% Result : Unsatisfiable 4.27s 2.07s
% Output : CNFRefutation 4.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 53
% Syntax : Number of formulae : 58 ( 8 unt; 50 typ; 0 def)
% Number of atoms : 8 ( 2 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 ( 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 : 41 ( 41 usr; 9 con; 0-3 aty)
% Number of variables : 2 (; 2 !; 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 > x > 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(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(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(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_918,axiom,
~ member(x,universal_class),
file(unknown,unknown) ).
tff(f_916,axiom,
singleton(member_of(x)) = x,
file(unknown,unknown) ).
tff(f_817,axiom,
! [X] : member(singleton(X),universal_class),
file(unknown,unknown) ).
tff(c_276,plain,
~ member(x,universal_class),
inference(cnfTransformation,[status(thm)],[f_918]) ).
tff(c_274,plain,
singleton(member_of(x)) = x,
inference(cnfTransformation,[status(thm)],[f_916]) ).
tff(c_291,plain,
! [X_268] : member(singleton(X_268),universal_class),
inference(cnfTransformation,[status(thm)],[f_817]) ).
tff(c_293,plain,
member(x,universal_class),
inference(superposition,[status(thm),theory(equality)],[c_274,c_291]) ).
tff(c_295,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_276,c_293]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SET093-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.13/0.14 % 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.14/0.36 % Computer : n023.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:09:37 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.27/2.07 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.27/2.08
% 4.27/2.08 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.74/2.10
% 4.74/2.10 Inference rules
% 4.74/2.10 ----------------------
% 4.74/2.10 #Ref : 0
% 4.74/2.10 #Sup : 3
% 4.74/2.10 #Fact : 0
% 4.74/2.10 #Define : 0
% 4.74/2.10 #Split : 0
% 4.74/2.10 #Chain : 0
% 4.74/2.10 #Close : 0
% 4.74/2.10
% 4.74/2.10 Ordering : KBO
% 4.74/2.10
% 4.74/2.10 Simplification rules
% 4.74/2.10 ----------------------
% 4.74/2.10 #Subsume : 2
% 4.74/2.10 #Demod : 5
% 4.74/2.10 #Tautology : 4
% 4.74/2.10 #SimpNegUnit : 1
% 4.74/2.10 #BackRed : 0
% 4.74/2.10
% 4.74/2.10 #Partial instantiations: 0
% 4.74/2.10 #Strategies tried : 1
% 4.74/2.10
% 4.74/2.10 Timing (in seconds)
% 4.74/2.10 ----------------------
% 4.74/2.10 Preprocessing : 0.75
% 4.74/2.11 Parsing : 0.36
% 4.74/2.11 CNF conversion : 0.05
% 4.74/2.11 Main loop : 0.30
% 4.74/2.11 Inferencing : 0.04
% 4.74/2.11 Reduction : 0.14
% 4.74/2.11 Demodulation : 0.10
% 4.74/2.11 BG Simplification : 0.04
% 4.74/2.11 Subsumption : 0.08
% 4.74/2.11 Abstraction : 0.01
% 4.74/2.11 MUC search : 0.00
% 4.74/2.11 Cooper : 0.00
% 4.74/2.11 Total : 1.09
% 4.74/2.11 Index Insertion : 0.00
% 4.74/2.11 Index Deletion : 0.00
% 4.74/2.11 Index Matching : 0.00
% 4.74/2.11 BG Taut test : 0.00
%------------------------------------------------------------------------------