TSTP Solution File: REL003+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : REL003+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n026.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:32:12 EDT 2023
% Result : Theorem 0.14s 0.31s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 10 unt; 0 def)
% Number of atoms : 86 ( 47 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 79 ( 35 ~; 27 |; 9 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 38 (; 30 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,conjecture,
! [X0,X1] :
( ( join(X0,X1) = X1
=> join(converse(X0),converse(X1)) = converse(X1) )
& ( join(converse(X0),converse(X1)) = converse(X1)
=> join(X0,X1) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( ( join(X0,X1) = X1
=> join(converse(X0),converse(X1)) = converse(X1) )
& ( join(converse(X0),converse(X1)) = converse(X1)
=> join(X0,X1) = X1 ) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f23,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f24,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f29,plain,
? [X0,X1] :
( ( join(X0,X1) = X1
& join(converse(X0),converse(X1)) != converse(X1) )
| ( join(converse(X0),converse(X1)) = converse(X1)
& join(X0,X1) != X1 ) ),
inference(pre_NNF_transformation,[status(esa)],[f15]) ).
fof(f30,plain,
! [X0,X1] :
( pd0_0(X1,X0)
=> ( join(X0,X1) = X1
& join(converse(X0),converse(X1)) != converse(X1) ) ),
introduced(predicate_definition,[f29]) ).
fof(f31,plain,
? [X0,X1] :
( pd0_0(X1,X0)
| ( join(converse(X0),converse(X1)) = converse(X1)
& join(X0,X1) != X1 ) ),
inference(formula_renaming,[status(thm)],[f29,f30]) ).
fof(f32,plain,
( ? [X0,X1] : pd0_0(X1,X0)
| ? [X0,X1] :
( join(converse(X0),converse(X1)) = converse(X1)
& join(X0,X1) != X1 ) ),
inference(miniscoping,[status(esa)],[f31]) ).
fof(f33,plain,
( pd0_0(sk0_1,sk0_0)
| ( join(converse(sk0_2),converse(sk0_3)) = converse(sk0_3)
& join(sk0_2,sk0_3) != sk0_3 ) ),
inference(skolemization,[status(esa)],[f32]) ).
fof(f34,plain,
( pd0_0(sk0_1,sk0_0)
| join(converse(sk0_2),converse(sk0_3)) = converse(sk0_3) ),
inference(cnf_transformation,[status(esa)],[f33]) ).
fof(f35,plain,
( pd0_0(sk0_1,sk0_0)
| join(sk0_2,sk0_3) != sk0_3 ),
inference(cnf_transformation,[status(esa)],[f33]) ).
fof(f36,plain,
! [X0,X1] :
( ~ pd0_0(X1,X0)
| ( join(X0,X1) = X1
& join(converse(X0),converse(X1)) != converse(X1) ) ),
inference(pre_NNF_transformation,[status(esa)],[f30]) ).
fof(f37,plain,
! [X0,X1] :
( ~ pd0_0(X0,X1)
| join(X1,X0) = X0 ),
inference(cnf_transformation,[status(esa)],[f36]) ).
fof(f38,plain,
! [X0,X1] :
( ~ pd0_0(X0,X1)
| join(converse(X1),converse(X0)) != converse(X0) ),
inference(cnf_transformation,[status(esa)],[f36]) ).
fof(f39,plain,
( spl0_0
<=> pd0_0(sk0_1,sk0_0) ),
introduced(split_symbol_definition) ).
fof(f40,plain,
( pd0_0(sk0_1,sk0_0)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f39]) ).
fof(f42,plain,
( spl0_1
<=> join(converse(sk0_2),converse(sk0_3)) = converse(sk0_3) ),
introduced(split_symbol_definition) ).
fof(f43,plain,
( join(converse(sk0_2),converse(sk0_3)) = converse(sk0_3)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f42]) ).
fof(f45,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f34,f39,f42]) ).
fof(f46,plain,
( spl0_2
<=> join(sk0_2,sk0_3) = sk0_3 ),
introduced(split_symbol_definition) ).
fof(f48,plain,
( join(sk0_2,sk0_3) != sk0_3
| spl0_2 ),
inference(component_clause,[status(thm)],[f46]) ).
fof(f49,plain,
( spl0_0
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f35,f39,f46]) ).
fof(f55,plain,
! [X0,X1] :
( ~ pd0_0(X0,X1)
| join(converse(X0),converse(X1)) != converse(X0) ),
inference(paramodulation,[status(thm)],[f16,f38]) ).
fof(f69,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X1),converse(X0)),
inference(paramodulation,[status(thm)],[f16,f24]) ).
fof(f70,plain,
! [X0,X1] : converse(join(X0,X1)) = converse(join(X1,X0)),
inference(forward_demodulation,[status(thm)],[f24,f69]) ).
fof(f237,plain,
! [X0,X1] :
( ~ pd0_0(X0,X1)
| converse(join(X0,X1)) != converse(X0) ),
inference(forward_demodulation,[status(thm)],[f24,f55]) ).
fof(f375,plain,
( converse(join(sk0_1,sk0_0)) != converse(sk0_1)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f40,f237]) ).
fof(f376,plain,
( converse(join(sk0_0,sk0_1)) != converse(sk0_1)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f70,f375]) ).
fof(f378,plain,
( join(sk0_0,sk0_1) = sk0_1
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f40,f37]) ).
fof(f385,plain,
( converse(sk0_1) != converse(sk0_1)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f378,f376]) ).
fof(f386,plain,
( $false
| ~ spl0_0 ),
inference(trivial_equality_resolution,[status(esa)],[f385]) ).
fof(f387,plain,
~ spl0_0,
inference(contradiction_clause,[status(thm)],[f386]) ).
fof(f388,plain,
( converse(join(sk0_2,sk0_3)) = converse(sk0_3)
| ~ spl0_1 ),
inference(forward_demodulation,[status(thm)],[f24,f43]) ).
fof(f404,plain,
( converse(converse(sk0_3)) = join(sk0_2,sk0_3)
| ~ spl0_1 ),
inference(paramodulation,[status(thm)],[f388,f23]) ).
fof(f405,plain,
( sk0_3 = join(sk0_2,sk0_3)
| ~ spl0_1 ),
inference(forward_demodulation,[status(thm)],[f23,f404]) ).
fof(f406,plain,
( $false
| spl0_2
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f405,f48]) ).
fof(f407,plain,
( spl0_2
| ~ spl0_1 ),
inference(contradiction_clause,[status(thm)],[f406]) ).
fof(f408,plain,
$false,
inference(sat_refutation,[status(thm)],[f45,f49,f387,f407]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : REL003+1 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n026.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue May 30 10:20:43 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.09/0.30 % Drodi V3.5.1
% 0.14/0.31 % Refutation found
% 0.14/0.31 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.56 % Elapsed time: 0.042572 seconds
% 0.14/0.56 % CPU time: 0.024228 seconds
% 0.14/0.56 % Memory used: 3.946 MB
%------------------------------------------------------------------------------