%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SET085-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n002.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:09 EDT 2024
% Result : Unsatisfiable 1.51s 1.68s
% Output : Refutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 9 unt; 2 nHn; 15 RR)
% Number of literals : 23 ( 9 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_singleton_in_unordered_pair3_4,negated_conjecture,
x != z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_4) ).
cnf(prove_singleton_in_unordered_pair3_3,negated_conjecture,
x != y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_3) ).
cnf(unordered_pair_member,axiom,
( ~ member(X31,unordered_pair(X32,X33))
| X31 = X32
| X31 = X33 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
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_singleton_in_unordered_pair3_2,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_2) ).
cnf(set_in_its_singleton,axiom,
( ~ member(X174,universal_class)
| member(X174,singleton(X174)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_in_its_singleton) ).
cnf(c296,plain,
member(x,singleton(x)),
inference(resolution,[status(thm)],[set_in_its_singleton,prove_singleton_in_unordered_pair3_2]) ).
cnf(c302,plain,
( ~ subclass(singleton(x),X440)
| member(x,X440) ),
inference(resolution,[status(thm)],[c296,subclass_members]) ).
cnf(equal_implies_subclass2,axiom,
( X22 != X23
| subclass(X23,X22) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',equal_implies_subclass2) ).
cnf(prove_singleton_in_unordered_pair3_1,negated_conjecture,
unordered_pair(y,z) = singleton(x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_1) ).
cnf(c903,plain,
subclass(singleton(x),unordered_pair(y,z)),
inference(resolution,[status(thm)],[prove_singleton_in_unordered_pair3_1,equal_implies_subclass2]) ).
cnf(c3021,plain,
member(x,unordered_pair(y,z)),
inference(resolution,[status(thm)],[c903,c302]) ).
cnf(c3024,plain,
( x = y
| x = z ),
inference(resolution,[status(thm)],[c3021,unordered_pair_member]) ).
cnf(c3567,plain,
x = z,
inference(resolution,[status(thm)],[c3024,prove_singleton_in_unordered_pair3_3]) ).
cnf(c3647,plain,
$false,
inference(resolution,[status(thm)],[c3567,prove_singleton_in_unordered_pair3_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET085-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.04/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed May 8 18:43:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 1.51/1.68 % Version: 1.5
% 1.51/1.68 % SZS status Unsatisfiable
% 1.51/1.68 % SZS output start CNFRefutation
% See solution above
% 1.51/1.68
% 1.51/1.68 % Initial clauses : 174
% 1.51/1.68 % Processed clauses : 364
% 1.51/1.68 % Factors computed : 29
% 1.51/1.68 % Resolvents computed: 3599
% 1.51/1.68 % Tautologies deleted: 13
% 1.51/1.68 % Forward subsumed : 202
% 1.51/1.68 % Backward subsumed : 4
% 1.51/1.68 % -------- CPU Time ---------
% 1.51/1.68 % User time : 1.286 s
% 1.51/1.68 % System time : 0.023 s
% 1.51/1.68 % Total time : 1.309 s
%------------------------------------------------------------------------------