TSTP Solution File: SWV061+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV061+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n031.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 : Tue Apr 30 20:45:52 EDT 2024
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 3 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 46 ( 19 ~; 9 |; 9 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 0 ( 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( true
=> ( ( ~ gt(loopcounter,n1)
=> true )
& ( gt(loopcounter,n1)
=> true ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( true
=> ( ( ~ gt(loopcounter,n1)
=> true )
& ( gt(loopcounter,n1)
=> true ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f244,plain,
( true
& ( ( ~ gt(loopcounter,n1)
& ~ true )
| ( gt(loopcounter,n1)
& ~ true ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f245,plain,
( pd0_3
=> ( ~ gt(loopcounter,n1)
& ~ true ) ),
introduced(predicate_definition,[f244]) ).
fof(f246,plain,
( true
& ( pd0_3
| ( gt(loopcounter,n1)
& ~ true ) ) ),
inference(formula_renaming,[status(thm)],[f244,f245]) ).
fof(f247,plain,
true,
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f249,plain,
( pd0_3
| ~ true ),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f309,plain,
( ~ pd0_3
| ( ~ gt(loopcounter,n1)
& ~ true ) ),
inference(pre_NNF_transformation,[status(esa)],[f245]) ).
fof(f311,plain,
( ~ pd0_3
| ~ true ),
inference(cnf_transformation,[status(esa)],[f309]) ).
fof(f318,plain,
( spl0_0
<=> pd0_3 ),
introduced(split_symbol_definition) ).
fof(f325,plain,
( spl0_2
<=> true ),
introduced(split_symbol_definition) ).
fof(f327,plain,
( ~ true
| spl0_2 ),
inference(component_clause,[status(thm)],[f325]) ).
fof(f328,plain,
( spl0_0
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f249,f318,f325]) ).
fof(f330,plain,
( ~ spl0_0
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f311,f318,f325]) ).
fof(f386,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f327,f247]) ).
fof(f387,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f386]) ).
fof(f388,plain,
$false,
inference(sat_refutation,[status(thm)],[f328,f330,f387]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV061+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.11/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n031.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 Apr 30 01:13:28 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.6.0
% 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.13/0.38 % Elapsed time: 0.028571 seconds
% 0.13/0.38 % CPU time: 0.042925 seconds
% 0.13/0.38 % Total memory used: 14.224 MB
% 0.13/0.38 % Net memory used: 14.184 MB
%------------------------------------------------------------------------------