%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SET074-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n013.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 : Thu May 9 17:39:06 EDT 2024
% Result : Unsatisfiable 1.32s 1.49s
% Output : Refutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 9 unt; 0 nHn; 9 RR)
% Number of literals : 23 ( 2 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(special_classes_lemma,axiom,
~ member(X52,intersection(complement(X51),X51)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',special_classes_lemma) ).
cnf(equal_implies_subclass1,axiom,
( X15 != X16
| subclass(X15,X16) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',equal_implies_subclass1) ).
cnf(prove_corollary_to_unordered_pair_axiom2_2,negated_conjecture,
unordered_pair(x,y) = null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_unordered_pair_axiom2_2) ).
cnf(c120,plain,
subclass(unordered_pair(x,y),null_class),
inference(resolution,[status(thm)],[prove_corollary_to_unordered_pair_axiom2_2,equal_implies_subclass1]) ).
cnf(null_class_is_subclass,axiom,
subclass(null_class,X9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_class_is_subclass) ).
cnf(transitivity_of_subclass,axiom,
( ~ subclass(X249,X250)
| ~ subclass(X250,X248)
| subclass(X249,X248) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_subclass) ).
cnf(c693,plain,
( ~ subclass(X257,null_class)
| subclass(X257,X258) ),
inference(resolution,[status(thm)],[transitivity_of_subclass,null_class_is_subclass]) ).
cnf(c703,plain,
subclass(unordered_pair(x,y),X261),
inference(resolution,[status(thm)],[c693,c120]) ).
cnf(subclass_members,axiom,
( ~ subclass(X6,X7)
| ~ member(X5,X6)
| member(X5,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(prove_corollary_to_unordered_pair_axiom2_1,negated_conjecture,
member(y,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_unordered_pair_axiom2_1) ).
cnf(unordered_pair3,axiom,
( ~ member(X58,universal_class)
| member(X58,unordered_pair(X57,X58)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(c70,plain,
member(y,unordered_pair(X69,y)),
inference(resolution,[status(thm)],[unordered_pair3,prove_corollary_to_unordered_pair_axiom2_1]) ).
cnf(c89,plain,
( ~ subclass(unordered_pair(X579,y),X580)
| member(y,X580) ),
inference(resolution,[status(thm)],[c70,subclass_members]) ).
cnf(c2926,plain,
member(y,X581),
inference(resolution,[status(thm)],[c89,c703]) ).
cnf(c2940,plain,
$false,
inference(resolution,[status(thm)],[c2926,special_classes_lemma]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET074-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/0.15 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Wed May 8 18:54:23 EDT 2024
% 0.15/0.37 % CPUTime :
% 1.32/1.49 % Version: 1.5
% 1.32/1.49 % SZS status Unsatisfiable
% 1.32/1.49 % SZS output start CNFRefutation
% See solution above
% 1.32/1.49
% 1.32/1.49 % Initial clauses : 159
% 1.32/1.49 % Processed clauses : 343
% 1.32/1.49 % Factors computed : 26
% 1.32/1.49 % Resolvents computed: 2886
% 1.32/1.49 % Tautologies deleted: 12
% 1.32/1.49 % Forward subsumed : 175
% 1.32/1.49 % Backward subsumed : 16
% 1.32/1.49 % -------- CPU Time ---------
% 1.32/1.49 % User time : 1.101 s
% 1.32/1.49 % System time : 0.020 s
% 1.32/1.49 % Total time : 1.121 s
%------------------------------------------------------------------------------