TSTP Solution File: SWC385-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC385-1 : TPTP v8.1.2. Released v2.4.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 : Tue Apr 30 20:45:35 EDT 2024
% Result : Unsatisfiable 0.19s 0.36s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 33 ( 13 unt; 0 def)
% Number of atoms : 54 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 17 ~; 17 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f190,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f191,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f192,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f193,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f194,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f195,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f430,plain,
sk2 = sk4,
inference(cnf_transformation,[status(esa)],[f190]) ).
fof(f431,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f432,plain,
neq(sk2,nil),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f433,plain,
segmentP(sk4,sk3),
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f434,plain,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[status(esa)],[f194]) ).
fof(f435,plain,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
inference(cnf_transformation,[status(esa)],[f195]) ).
fof(f443,plain,
( spl0_2
<=> singletonP(sk3) ),
introduced(split_symbol_definition) ).
fof(f444,plain,
( singletonP(sk3)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f443]) ).
fof(f446,plain,
( spl0_3
<=> neq(sk4,nil) ),
introduced(split_symbol_definition) ).
fof(f448,plain,
( ~ neq(sk4,nil)
| spl0_3 ),
inference(component_clause,[status(thm)],[f446]) ).
fof(f449,plain,
( spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f434,f443,f446]) ).
fof(f450,plain,
( spl0_4
<=> singletonP(sk1) ),
introduced(split_symbol_definition) ).
fof(f452,plain,
( ~ singletonP(sk1)
| spl0_4 ),
inference(component_clause,[status(thm)],[f450]) ).
fof(f453,plain,
( spl0_5
<=> segmentP(sk2,sk1) ),
introduced(split_symbol_definition) ).
fof(f455,plain,
( ~ segmentP(sk2,sk1)
| spl0_5 ),
inference(component_clause,[status(thm)],[f453]) ).
fof(f456,plain,
( ~ spl0_4
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f435,f450,f453]) ).
fof(f488,plain,
segmentP(sk2,sk3),
inference(forward_demodulation,[status(thm)],[f430,f433]) ).
fof(f489,plain,
segmentP(sk2,sk1),
inference(forward_demodulation,[status(thm)],[f431,f488]) ).
fof(f512,plain,
( ~ neq(sk2,nil)
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f430,f448]) ).
fof(f513,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f512,f432]) ).
fof(f514,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f513]) ).
fof(f515,plain,
( singletonP(sk1)
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f431,f444]) ).
fof(f516,plain,
( $false
| spl0_4
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f515,f452]) ).
fof(f517,plain,
( spl0_4
| ~ spl0_2 ),
inference(contradiction_clause,[status(thm)],[f516]) ).
fof(f519,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f455,f489]) ).
fof(f520,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f519]) ).
fof(f521,plain,
$false,
inference(sat_refutation,[status(thm)],[f449,f456,f514,f517,f520]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC385-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 29 23:33:18 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.36 % Drodi V3.6.0
% 0.19/0.36 % Refutation found
% 0.19/0.36 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.19/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.37 % Elapsed time: 0.023677 seconds
% 0.19/0.37 % CPU time: 0.033775 seconds
% 0.19/0.37 % Total memory used: 14.243 MB
% 0.19/0.37 % Net memory used: 14.228 MB
%------------------------------------------------------------------------------