TSTP Solution File: SEU127+2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SEU127+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n017.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 : Wed May 31 12:35:53 EDT 2023
% Result : Theorem 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 93 ( 10 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 107 ( 39 ~; 41 |; 22 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 77 (; 71 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [A,B,C] :
( C = set_intersection2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f23,conjecture,
! [A,B] : subset(set_intersection2(A,B),A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f24,negated_conjecture,
~ ! [A,B] : subset(set_intersection2(A,B),A),
inference(negated_conjecture,[status(cth)],[f23]) ).
fof(f40,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f60,plain,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( ~ in(C,A)
| in(C,B) ) ),
inference(pre_NNF_transformation,[status(esa)],[f7]) ).
fof(f61,plain,
! [A,B] :
( ( ~ subset(A,B)
| ! [C] :
( ~ in(C,A)
| in(C,B) ) )
& ( subset(A,B)
| ? [C] :
( in(C,A)
& ~ in(C,B) ) ) ),
inference(NNF_transformation,[status(esa)],[f60]) ).
fof(f62,plain,
( ! [A,B] :
( ~ subset(A,B)
| ! [C] :
( ~ in(C,A)
| in(C,B) ) )
& ! [A,B] :
( subset(A,B)
| ? [C] :
( in(C,A)
& ~ in(C,B) ) ) ),
inference(miniscoping,[status(esa)],[f61]) ).
fof(f63,plain,
( ! [A,B] :
( ~ subset(A,B)
| ! [C] :
( ~ in(C,A)
| in(C,B) ) )
& ! [A,B] :
( subset(A,B)
| ( in(sk0_2(B,A),A)
& ~ in(sk0_2(B,A),B) ) ) ),
inference(skolemization,[status(esa)],[f62]) ).
fof(f65,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sk0_2(X1,X0),X0) ),
inference(cnf_transformation,[status(esa)],[f63]) ).
fof(f66,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sk0_2(X1,X0),X1) ),
inference(cnf_transformation,[status(esa)],[f63]) ).
fof(f67,plain,
! [A,B,C] :
( ( C != set_intersection2(A,B)
| ! [D] :
( ( ~ in(D,C)
| ( in(D,A)
& in(D,B) ) )
& ( in(D,C)
| ~ in(D,A)
| ~ in(D,B) ) ) )
& ( C = set_intersection2(A,B)
| ? [D] :
( ( ~ in(D,C)
| ~ in(D,A)
| ~ in(D,B) )
& ( in(D,C)
| ( in(D,A)
& in(D,B) ) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f8]) ).
fof(f68,plain,
( ! [A,B,C] :
( C != set_intersection2(A,B)
| ( ! [D] :
( ~ in(D,C)
| ( in(D,A)
& in(D,B) ) )
& ! [D] :
( in(D,C)
| ~ in(D,A)
| ~ in(D,B) ) ) )
& ! [A,B,C] :
( C = set_intersection2(A,B)
| ? [D] :
( ( ~ in(D,C)
| ~ in(D,A)
| ~ in(D,B) )
& ( in(D,C)
| ( in(D,A)
& in(D,B) ) ) ) ) ),
inference(miniscoping,[status(esa)],[f67]) ).
fof(f69,plain,
( ! [A,B,C] :
( C != set_intersection2(A,B)
| ( ! [D] :
( ~ in(D,C)
| ( in(D,A)
& in(D,B) ) )
& ! [D] :
( in(D,C)
| ~ in(D,A)
| ~ in(D,B) ) ) )
& ! [A,B,C] :
( C = set_intersection2(A,B)
| ( ( ~ in(sk0_3(C,B,A),C)
| ~ in(sk0_3(C,B,A),A)
| ~ in(sk0_3(C,B,A),B) )
& ( in(sk0_3(C,B,A),C)
| ( in(sk0_3(C,B,A),A)
& in(sk0_3(C,B,A),B) ) ) ) ) ),
inference(skolemization,[status(esa)],[f68]) ).
fof(f71,plain,
! [X0,X1,X2,X3] :
( X0 != set_intersection2(X1,X2)
| ~ in(X3,X0)
| in(X3,X2) ),
inference(cnf_transformation,[status(esa)],[f69]) ).
fof(f101,plain,
? [A,B] : ~ subset(set_intersection2(A,B),A),
inference(pre_NNF_transformation,[status(esa)],[f24]) ).
fof(f102,plain,
~ subset(set_intersection2(sk0_6,sk0_7),sk0_6),
inference(skolemization,[status(esa)],[f101]) ).
fof(f103,plain,
~ subset(set_intersection2(sk0_6,sk0_7),sk0_6),
inference(cnf_transformation,[status(esa)],[f102]) ).
fof(f141,plain,
! [X0,X1,X2] :
( ~ in(X0,set_intersection2(X1,X2))
| in(X0,X2) ),
inference(destructive_equality_resolution,[status(esa)],[f71]) ).
fof(f1190,plain,
! [X0,X1,X2] :
( subset(set_intersection2(X0,X1),X2)
| in(sk0_2(X2,set_intersection2(X0,X1)),X1) ),
inference(resolution,[status(thm)],[f65,f141]) ).
fof(f1858,plain,
! [X0,X1] :
( subset(set_intersection2(X0,X1),X1)
| subset(set_intersection2(X0,X1),X1) ),
inference(resolution,[status(thm)],[f1190,f66]) ).
fof(f1859,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X1),
inference(duplicate_literals_removal,[status(esa)],[f1858]) ).
fof(f1892,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(paramodulation,[status(thm)],[f40,f1859]) ).
fof(f1901,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f103,f1892]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU127+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30 % Computer : n017.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue May 30 08:39:40 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.31 % Drodi V3.5.1
% 0.15/0.40 % Refutation found
% 0.15/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.43 % Elapsed time: 0.108440 seconds
% 0.15/0.43 % CPU time: 0.309719 seconds
% 0.15/0.43 % Memory used: 46.308 MB
%------------------------------------------------------------------------------