%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : SET074-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n011.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 : 600s
% DateTime : Tue Jul 19 03:32:14 EDT 2022
% Result : Unsatisfiable 1.20s 1.36s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 9 RR)
% Number of literals : 17 ( 2 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 5 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair3,axiom,
( ~ member(Y,universal_class)
| member(Y,unordered_pair(X,Y)) ) ).
cnf(existence_of_null_class,axiom,
~ member(Z,null_class) ).
cnf(prove_corollary_to_unordered_pair_axiom2_1,negated_conjecture,
member(y,universal_class) ).
cnf(prove_corollary_to_unordered_pair_axiom2_2,negated_conjecture,
unordered_pair(x,y) = null_class ).
cnf(refute_0_0,plain,
( ~ member(y,universal_class)
| member(y,unordered_pair(X_138,y)) ),
inference(subst,[],[unordered_pair3:[bind(X,$fot(X_138)),bind(Y,$fot(y))]]) ).
cnf(refute_0_1,plain,
member(y,unordered_pair(X_138,y)),
inference(resolve,[$cnf( member(y,universal_class) )],[prove_corollary_to_unordered_pair_axiom2_1,refute_0_0]) ).
cnf(refute_0_2,plain,
member(y,unordered_pair(x,y)),
inference(subst,[],[refute_0_1:[bind(X_138,$fot(x))]]) ).
cnf(refute_0_3,plain,
( unordered_pair(x,y) != null_class
| ~ member(y,unordered_pair(x,y))
| member(y,null_class) ),
introduced(tautology,[equality,[$cnf( member(y,unordered_pair(x,y)) ),[1],$fot(null_class)]]) ).
cnf(refute_0_4,plain,
( ~ member(y,unordered_pair(x,y))
| member(y,null_class) ),
inference(resolve,[$cnf( $equal(unordered_pair(x,y),null_class) )],[prove_corollary_to_unordered_pair_axiom2_2,refute_0_3]) ).
cnf(refute_0_5,plain,
member(y,null_class),
inference(resolve,[$cnf( member(y,unordered_pair(x,y)) )],[refute_0_2,refute_0_4]) ).
cnf(refute_0_6,plain,
~ member(y,null_class),
inference(subst,[],[existence_of_null_class:[bind(Z,$fot(y))]]) ).
cnf(refute_0_7,plain,
$false,
inference(resolve,[$cnf( member(y,null_class) )],[refute_0_5,refute_0_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET074-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : metis --show proof --show saturation %s
% 0.13/0.34 % Computer : n011.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 : 600
% 0.13/0.34 % DateTime : Sun Jul 10 11:39:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 1.20/1.36 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.20/1.36
% 1.20/1.36 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.20/1.36
%------------------------------------------------------------------------------