TSTP Solution File: REL003-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% 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 : n008.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:37:18 EDT 2024
% Result : Unsatisfiable 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 5 unt; 0 def)
% Number of atoms : 50 ( 23 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 44 ( 20 ~; 22 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [A] : converse(converse(A)) = A,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [A,B] : converse(join(A,B)) = join(converse(A),converse(B)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,negated_conjecture,
( join(sk1,sk2) = sk2
| join(converse(sk1),converse(sk2)) = converse(sk2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,negated_conjecture,
( join(sk1,sk2) != sk2
| join(converse(sk1),converse(sk2)) != converse(sk2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
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,
( join(sk1,sk2) = sk2
| join(converse(sk1),converse(sk2)) = converse(sk2) ),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f30,plain,
( join(sk1,sk2) != sk2
| join(converse(sk1),converse(sk2)) != converse(sk2) ),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f31,plain,
( spl0_0
<=> join(sk1,sk2) = sk2 ),
introduced(split_symbol_definition) ).
fof(f32,plain,
( join(sk1,sk2) = sk2
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f31]) ).
fof(f33,plain,
( join(sk1,sk2) != sk2
| spl0_0 ),
inference(component_clause,[status(thm)],[f31]) ).
fof(f34,plain,
( spl0_1
<=> join(converse(sk1),converse(sk2)) = converse(sk2) ),
introduced(split_symbol_definition) ).
fof(f35,plain,
( join(converse(sk1),converse(sk2)) = converse(sk2)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f34]) ).
fof(f36,plain,
( join(converse(sk1),converse(sk2)) != converse(sk2)
| spl0_1 ),
inference(component_clause,[status(thm)],[f34]) ).
fof(f37,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f29,f31,f34]) ).
fof(f38,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f30,f31,f34]) ).
fof(f40,plain,
( converse(join(sk1,sk2)) = converse(sk2)
| ~ spl0_1 ),
inference(forward_demodulation,[status(thm)],[f24,f35]) ).
fof(f43,plain,
( converse(converse(sk2)) = join(sk1,sk2)
| ~ spl0_1 ),
inference(paramodulation,[status(thm)],[f40,f23]) ).
fof(f44,plain,
( sk2 = join(sk1,sk2)
| ~ spl0_1 ),
inference(forward_demodulation,[status(thm)],[f23,f43]) ).
fof(f45,plain,
( $false
| spl0_0
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f44,f33]) ).
fof(f46,plain,
( spl0_0
| ~ spl0_1 ),
inference(contradiction_clause,[status(thm)],[f45]) ).
fof(f47,plain,
( converse(join(sk1,sk2)) != converse(sk2)
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f24,f36]) ).
fof(f48,plain,
( converse(sk2) != converse(sk2)
| ~ spl0_0
| spl0_1 ),
inference(backward_demodulation,[status(thm)],[f32,f47]) ).
fof(f49,plain,
( $false
| ~ spl0_0
| spl0_1 ),
inference(trivial_equality_resolution,[status(esa)],[f48]) ).
fof(f50,plain,
( ~ spl0_0
| spl0_1 ),
inference(contradiction_clause,[status(thm)],[f49]) ).
fof(f51,plain,
$false,
inference(sat_refutation,[status(thm)],[f37,f38,f46,f50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL003-1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n008.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 : Mon Apr 29 21:06:13 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 Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.37 % Elapsed time: 0.022112 seconds
% 0.13/0.37 % CPU time: 0.042756 seconds
% 0.13/0.37 % Total memory used: 13.054 MB
% 0.13/0.37 % Net memory used: 13.048 MB
%------------------------------------------------------------------------------