TSTP Solution File: GEO227+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GEO227+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n005.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:08:26 EDT 2023
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 7 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 55 ( 24 ~; 15 |; 11 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 13 (; 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13,axiom,
! [L,M] :
( ( line(L)
& line(M) )
=> ( unequally_directed_lines(L,M)
| unequally_directed_lines(L,reverse_line(M)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f32,conjecture,
! [L,M] :
( ( line(L)
& line(M) )
=> ~ ( ~ unequally_directed_lines(L,M)
& ~ unequally_directed_lines(L,reverse_line(M)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f33,negated_conjecture,
~ ! [L,M] :
( ( line(L)
& line(M) )
=> ~ ( ~ unequally_directed_lines(L,M)
& ~ unequally_directed_lines(L,reverse_line(M)) ) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f88,plain,
! [L,M] :
( ~ line(L)
| ~ line(M)
| unequally_directed_lines(L,M)
| unequally_directed_lines(L,reverse_line(M)) ),
inference(pre_NNF_transformation,[status(esa)],[f13]) ).
fof(f89,plain,
! [X0,X1] :
( ~ line(X0)
| ~ line(X1)
| unequally_directed_lines(X0,X1)
| unequally_directed_lines(X0,reverse_line(X1)) ),
inference(cnf_transformation,[status(esa)],[f88]) ).
fof(f130,plain,
? [L,M] :
( line(L)
& line(M)
& ~ unequally_directed_lines(L,M)
& ~ unequally_directed_lines(L,reverse_line(M)) ),
inference(pre_NNF_transformation,[status(esa)],[f33]) ).
fof(f131,plain,
( line(sk0_0)
& line(sk0_1)
& ~ unequally_directed_lines(sk0_0,sk0_1)
& ~ unequally_directed_lines(sk0_0,reverse_line(sk0_1)) ),
inference(skolemization,[status(esa)],[f130]) ).
fof(f132,plain,
line(sk0_0),
inference(cnf_transformation,[status(esa)],[f131]) ).
fof(f133,plain,
line(sk0_1),
inference(cnf_transformation,[status(esa)],[f131]) ).
fof(f134,plain,
~ unequally_directed_lines(sk0_0,sk0_1),
inference(cnf_transformation,[status(esa)],[f131]) ).
fof(f135,plain,
~ unequally_directed_lines(sk0_0,reverse_line(sk0_1)),
inference(cnf_transformation,[status(esa)],[f131]) ).
fof(f152,plain,
! [X0] :
( ~ line(X0)
| unequally_directed_lines(X0,sk0_1)
| unequally_directed_lines(X0,reverse_line(sk0_1)) ),
inference(resolution,[status(thm)],[f89,f133]) ).
fof(f163,plain,
( spl0_2
<=> unequally_directed_lines(sk0_0,sk0_1) ),
introduced(split_symbol_definition) ).
fof(f164,plain,
( unequally_directed_lines(sk0_0,sk0_1)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f163]) ).
fof(f166,plain,
( spl0_3
<=> unequally_directed_lines(sk0_0,reverse_line(sk0_1)) ),
introduced(split_symbol_definition) ).
fof(f167,plain,
( unequally_directed_lines(sk0_0,reverse_line(sk0_1))
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f166]) ).
fof(f169,plain,
( unequally_directed_lines(sk0_0,sk0_1)
| unequally_directed_lines(sk0_0,reverse_line(sk0_1)) ),
inference(resolution,[status(thm)],[f152,f132]) ).
fof(f170,plain,
( spl0_2
| spl0_3 ),
inference(split_clause,[status(thm)],[f169,f163,f166]) ).
fof(f171,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f164,f134]) ).
fof(f172,plain,
~ spl0_2,
inference(contradiction_clause,[status(thm)],[f171]) ).
fof(f175,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f167,f135]) ).
fof(f176,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f175]) ).
fof(f177,plain,
$false,
inference(sat_refutation,[status(thm)],[f170,f172,f176]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO227+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n005.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 : Tue May 30 12:02:21 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.59 % Elapsed time: 0.017140 seconds
% 0.21/0.59 % CPU time: 0.020731 seconds
% 0.21/0.59 % Memory used: 618.280 KB
%------------------------------------------------------------------------------