%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SET073-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n024.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.29s 1.53s
% Output : Refutation 1.29s
% 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(X51,intersection(complement(X52),X52)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',special_classes_lemma) ).
cnf(equal_implies_subclass1,axiom,
( X16 != X15
| subclass(X16,X15) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',equal_implies_subclass1) ).
cnf(prove_corollary_to_unordered_pair_axiom1_2,negated_conjecture,
unordered_pair(x,y) = null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_unordered_pair_axiom1_2) ).
cnf(c122,plain,
subclass(unordered_pair(x,y),null_class),
inference(resolution,[status(thm)],[prove_corollary_to_unordered_pair_axiom1_2,equal_implies_subclass1]) ).
cnf(null_class_is_subclass,axiom,
subclass(null_class,X9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',null_class_is_subclass) ).
cnf(transitivity_of_subclass,axiom,
( ~ subclass(X250,X248)
| ~ subclass(X248,X249)
| subclass(X250,X249) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_subclass) ).
cnf(c682,plain,
( ~ subclass(X256,null_class)
| subclass(X256,X255) ),
inference(resolution,[status(thm)],[transitivity_of_subclass,null_class_is_subclass]) ).
cnf(c704,plain,
subclass(unordered_pair(x,y),X261),
inference(resolution,[status(thm)],[c682,c122]) ).
cnf(subclass_members,axiom,
( ~ subclass(X7,X5)
| ~ member(X6,X7)
| member(X6,X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(prove_corollary_to_unordered_pair_axiom1_1,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_unordered_pair_axiom1_1) ).
cnf(unordered_pair2,axiom,
( ~ member(X48,universal_class)
| member(X48,unordered_pair(X48,X47)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(c62,plain,
member(x,unordered_pair(x,X61)),
inference(resolution,[status(thm)],[unordered_pair2,prove_corollary_to_unordered_pair_axiom1_1]) ).
cnf(c78,plain,
( ~ subclass(unordered_pair(x,X564),X565)
| member(x,X565) ),
inference(resolution,[status(thm)],[c62,subclass_members]) ).
cnf(c2828,plain,
member(x,X566),
inference(resolution,[status(thm)],[c78,c704]) ).
cnf(c2836,plain,
$false,
inference(resolution,[status(thm)],[c2828,special_classes_lemma]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET073-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n024.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 : 300
% 0.13/0.34 % DateTime : Wed May 8 18:52:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 1.29/1.53 % Version: 1.5
% 1.29/1.53 % SZS status Unsatisfiable
% 1.29/1.53 % SZS output start CNFRefutation
% See solution above
% 1.29/1.53
% 1.29/1.53 % Initial clauses : 159
% 1.29/1.53 % Processed clauses : 338
% 1.29/1.53 % Factors computed : 24
% 1.29/1.53 % Resolvents computed: 2792
% 1.29/1.53 % Tautologies deleted: 12
% 1.29/1.53 % Forward subsumed : 168
% 1.29/1.53 % Backward subsumed : 13
% 1.29/1.53 % -------- CPU Time ---------
% 1.29/1.53 % User time : 1.158 s
% 1.29/1.53 % System time : 0.019 s
% 1.29/1.53 % Total time : 1.177 s
%------------------------------------------------------------------------------