%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SET639+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n012.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:54 EDT 2024
% Result : Theorem 0.47s 0.65s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 46 ( 34 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 14 ~; 8 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 14 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th121,conjecture,
! [B,C] :
( ( subset(B,C)
& intersection(C,B) = empty_set )
=> B = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th121) ).
fof(c4,negated_conjecture,
~ ! [B,C] :
( ( subset(B,C)
& intersection(C,B) = empty_set )
=> B = empty_set ),
inference(assume_negation,[status(cth)],[prove_th121]) ).
fof(c5,negated_conjecture,
? [B,C] :
( subset(B,C)
& intersection(C,B) = empty_set
& B != empty_set ),
inference(fof_nnf,[status(thm)],[c4]) ).
fof(c6,negated_conjecture,
? [B] :
( ? [C] :
( subset(B,C)
& intersection(C,B) = empty_set )
& B != empty_set ),
inference(shift_quantors,[status(thm)],[c5]) ).
fof(c7,negated_conjecture,
? [X2] :
( ? [X3] :
( subset(X2,X3)
& intersection(X3,X2) = empty_set )
& X2 != empty_set ),
inference(variable_rename,[status(thm)],[c6]) ).
fof(c8,negated_conjecture,
( subset(skolem0001,skolem0002)
& intersection(skolem0002,skolem0001) = empty_set
& skolem0001 != empty_set ),
inference(skolemize,[status(esa)],[c7]) ).
cnf(c11,negated_conjecture,
skolem0001 != empty_set,
inference(split_conjunct,[status(thm)],[c8]) ).
cnf(transitivity,axiom,
( X51 != X50
| X50 != X52
| X51 = X52 ),
theory(equality) ).
cnf(c10,negated_conjecture,
intersection(skolem0002,skolem0001) = empty_set,
inference(split_conjunct,[status(thm)],[c8]) ).
cnf(c80,plain,
( X160 != intersection(skolem0002,skolem0001)
| X160 = empty_set ),
inference(resolution,[status(thm)],[c10,transitivity]) ).
cnf(symmetry,axiom,
( X41 != X40
| X40 = X41 ),
theory(equality) ).
cnf(c9,negated_conjecture,
subset(skolem0001,skolem0002),
inference(split_conjunct,[status(thm)],[c8]) ).
fof(subset_intersection,axiom,
! [B,C] :
( subset(B,C)
=> intersection(B,C) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_intersection) ).
fof(c62,plain,
! [B,C] :
( ~ subset(B,C)
| intersection(B,C) = B ),
inference(fof_nnf,[status(thm)],[subset_intersection]) ).
fof(c63,plain,
! [X35,X36] :
( ~ subset(X35,X36)
| intersection(X35,X36) = X35 ),
inference(variable_rename,[status(thm)],[c62]) ).
cnf(c64,plain,
( ~ subset(X110,X111)
| intersection(X110,X111) = X110 ),
inference(split_conjunct,[status(thm)],[c63]) ).
cnf(c125,plain,
intersection(skolem0001,skolem0002) = skolem0001,
inference(resolution,[status(thm)],[c64,c9]) ).
cnf(c217,plain,
skolem0001 = intersection(skolem0001,skolem0002),
inference(resolution,[status(thm)],[c125,symmetry]) ).
fof(commutativity_of_intersection,axiom,
! [B,C] : intersection(B,C) = intersection(C,B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(c32,plain,
! [X16,X17] : intersection(X16,X17) = intersection(X17,X16),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c33,plain,
intersection(X66,X67) = intersection(X67,X66),
inference(split_conjunct,[status(thm)],[c32]) ).
cnf(c86,plain,
( X172 != intersection(X171,X173)
| X172 = intersection(X173,X171) ),
inference(resolution,[status(thm)],[c33,transitivity]) ).
cnf(c359,plain,
skolem0001 = intersection(skolem0002,skolem0001),
inference(resolution,[status(thm)],[c86,c217]) ).
cnf(c437,plain,
skolem0001 = empty_set,
inference(resolution,[status(thm)],[c359,c80]) ).
cnf(c469,plain,
$false,
inference(resolution,[status(thm)],[c437,c11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET639+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.35 % Computer : n012.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:22:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.47/0.65 % Version: 1.5
% 0.47/0.65 % SZS status Theorem
% 0.47/0.65 % SZS output start CNFRefutation
% See solution above
% 0.47/0.65
% 0.47/0.65 % Initial clauses : 29
% 0.47/0.65 % Processed clauses : 78
% 0.47/0.65 % Factors computed : 7
% 0.47/0.65 % Resolvents computed: 404
% 0.47/0.65 % Tautologies deleted: 4
% 0.47/0.65 % Forward subsumed : 63
% 0.47/0.65 % Backward subsumed : 1
% 0.47/0.65 % -------- CPU Time ---------
% 0.47/0.65 % User time : 0.270 s
% 0.47/0.65 % System time : 0.021 s
% 0.47/0.65 % Total time : 0.291 s
%------------------------------------------------------------------------------