TSTP Solution File: SWC367-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC367-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n001.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:40:13 EDT 2023
% Result : Unsatisfiable 0.15s 0.54s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 11 unt; 0 def)
% Number of atoms : 66 ( 14 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 54 ( 25 ~; 25 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 2 (; 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f58,axiom,
! [U] :
( ~ ssList(U)
| rearsegP(U,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f190,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f191,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f192,negated_conjecture,
~ rearsegP(sk2,sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f194,negated_conjecture,
( nil = sk4
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f196,negated_conjecture,
( nil = sk3
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f204,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f254,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,nil) ),
inference(cnf_transformation,[status(esa)],[f58]) ).
fof(f431,plain,
sk2 = sk4,
inference(cnf_transformation,[status(esa)],[f190]) ).
fof(f432,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f433,plain,
~ rearsegP(sk2,sk1),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f435,plain,
( nil = sk4
| rearsegP(sk4,sk3) ),
inference(cnf_transformation,[status(esa)],[f194]) ).
fof(f437,plain,
( nil = sk3
| rearsegP(sk4,sk3) ),
inference(cnf_transformation,[status(esa)],[f196]) ).
fof(f445,plain,
( spl0_2
<=> nil = sk4 ),
introduced(split_symbol_definition) ).
fof(f446,plain,
( nil = sk4
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f445]) ).
fof(f452,plain,
( spl0_4
<=> rearsegP(sk4,sk3) ),
introduced(split_symbol_definition) ).
fof(f453,plain,
( rearsegP(sk4,sk3)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f452]) ).
fof(f455,plain,
( spl0_2
| spl0_4 ),
inference(split_clause,[status(thm)],[f435,f445,f452]) ).
fof(f456,plain,
( spl0_5
<=> nil = sk3 ),
introduced(split_symbol_definition) ).
fof(f457,plain,
( nil = sk3
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f456]) ).
fof(f460,plain,
( spl0_5
| spl0_4 ),
inference(split_clause,[status(thm)],[f437,f456,f452]) ).
fof(f492,plain,
( spl0_6
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f494,plain,
( ~ ssList(nil)
| spl0_6 ),
inference(component_clause,[status(thm)],[f492]) ).
fof(f502,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f494,f204]) ).
fof(f503,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f502]) ).
fof(f510,plain,
( nil = sk1
| ~ spl0_5 ),
inference(forward_demodulation,[status(thm)],[f432,f457]) ).
fof(f511,plain,
( ~ rearsegP(sk2,nil)
| ~ spl0_5 ),
inference(backward_demodulation,[status(thm)],[f510,f433]) ).
fof(f514,plain,
( nil = sk2
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f431,f446]) ).
fof(f517,plain,
( ~ rearsegP(nil,nil)
| ~ spl0_2
| ~ spl0_5 ),
inference(forward_demodulation,[status(thm)],[f514,f511]) ).
fof(f518,plain,
( ~ ssList(nil)
| ~ spl0_2
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f517,f254]) ).
fof(f519,plain,
( ~ spl0_6
| ~ spl0_2
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f518,f492,f445,f456]) ).
fof(f542,plain,
( rearsegP(sk2,sk3)
| ~ spl0_4 ),
inference(backward_demodulation,[status(thm)],[f431,f453]) ).
fof(f562,plain,
( rearsegP(sk2,sk1)
| ~ spl0_4 ),
inference(backward_demodulation,[status(thm)],[f432,f542]) ).
fof(f578,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f433,f562]) ).
fof(f579,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f578]) ).
fof(f580,plain,
$false,
inference(sat_refutation,[status(thm)],[f455,f460,f503,f519,f579]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.10 % Problem : SWC367-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n001.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 11:53:00 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.31 % Drodi V3.5.1
% 0.15/0.54 % Refutation found
% 0.15/0.54 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.54 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.54 % Elapsed time: 0.018392 seconds
% 0.15/0.54 % CPU time: 0.018638 seconds
% 0.15/0.54 % Memory used: 4.059 MB
%------------------------------------------------------------------------------