TSTP Solution File: SET838-2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET838-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.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:35:19 EDT 2023
% Result : Unsatisfiable 0.14s 0.32s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 72 ( 33 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 66 ( 30 ~; 30 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 7 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 6 (; 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
v_f(v_g(v_x)) = v_x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
! [V_U] :
( V_U = v_x
| v_f(v_g(V_U)) != V_U ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
! [V_U] :
( v_g(v_f(v_xa(V_U))) = v_xa(V_U)
| v_g(v_f(V_U)) != V_U ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
! [V_U] :
( v_xa(V_U) != V_U
| v_g(v_f(V_U)) != V_U ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,plain,
v_f(v_g(v_x)) = v_x,
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f6,plain,
! [X0] :
( X0 = v_x
| v_f(v_g(X0)) != X0 ),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f7,plain,
! [X0] :
( v_g(v_f(v_xa(X0))) = v_xa(X0)
| v_g(v_f(X0)) != X0 ),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f8,plain,
! [X0] :
( v_xa(X0) != X0
| v_g(v_f(X0)) != X0 ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f14,plain,
( spl0_1
<=> v_xa(v_g(v_x)) = v_g(v_x) ),
introduced(split_symbol_definition) ).
fof(f16,plain,
( v_xa(v_g(v_x)) != v_g(v_x)
| spl0_1 ),
inference(component_clause,[status(thm)],[f14]) ).
fof(f17,plain,
( spl0_2
<=> v_g(v_x) = v_g(v_x) ),
introduced(split_symbol_definition) ).
fof(f19,plain,
( v_g(v_x) != v_g(v_x)
| spl0_2 ),
inference(component_clause,[status(thm)],[f17]) ).
fof(f20,plain,
( v_xa(v_g(v_x)) != v_g(v_x)
| v_g(v_x) != v_g(v_x) ),
inference(paramodulation,[status(thm)],[f5,f8]) ).
fof(f21,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f20,f14,f17]) ).
fof(f22,plain,
( spl0_3
<=> v_g(v_f(v_xa(v_g(v_x)))) = v_xa(v_g(v_x)) ),
introduced(split_symbol_definition) ).
fof(f23,plain,
( v_g(v_f(v_xa(v_g(v_x)))) = v_xa(v_g(v_x))
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f22]) ).
fof(f25,plain,
( v_g(v_f(v_xa(v_g(v_x)))) = v_xa(v_g(v_x))
| v_g(v_x) != v_g(v_x) ),
inference(paramodulation,[status(thm)],[f5,f7]) ).
fof(f26,plain,
( spl0_3
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f25,f22,f17]) ).
fof(f27,plain,
( $false
| spl0_2 ),
inference(trivial_equality_resolution,[status(esa)],[f19]) ).
fof(f28,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f27]) ).
fof(f34,plain,
( spl0_5
<=> v_xa(v_g(v_x)) = v_xa(v_g(v_x)) ),
introduced(split_symbol_definition) ).
fof(f36,plain,
( v_xa(v_g(v_x)) != v_xa(v_g(v_x))
| spl0_5 ),
inference(component_clause,[status(thm)],[f34]) ).
fof(f44,plain,
( spl0_7
<=> v_f(v_xa(v_g(v_x))) = v_x ),
introduced(split_symbol_definition) ).
fof(f45,plain,
( v_f(v_xa(v_g(v_x))) = v_x
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f44]) ).
fof(f47,plain,
( spl0_8
<=> v_f(v_xa(v_g(v_x))) = v_f(v_xa(v_g(v_x))) ),
introduced(split_symbol_definition) ).
fof(f49,plain,
( v_f(v_xa(v_g(v_x))) != v_f(v_xa(v_g(v_x)))
| spl0_8 ),
inference(component_clause,[status(thm)],[f47]) ).
fof(f50,plain,
( v_f(v_xa(v_g(v_x))) = v_x
| v_f(v_xa(v_g(v_x))) != v_f(v_xa(v_g(v_x)))
| ~ spl0_3 ),
inference(paramodulation,[status(thm)],[f23,f6]) ).
fof(f51,plain,
( spl0_7
| ~ spl0_8
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f50,f44,f47,f22]) ).
fof(f52,plain,
( $false
| spl0_8 ),
inference(trivial_equality_resolution,[status(esa)],[f49]) ).
fof(f53,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f52]) ).
fof(f54,plain,
( $false
| spl0_5 ),
inference(trivial_equality_resolution,[status(esa)],[f36]) ).
fof(f55,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f54]) ).
fof(f56,plain,
( v_g(v_x) = v_xa(v_g(v_x))
| ~ spl0_7
| ~ spl0_3 ),
inference(backward_demodulation,[status(thm)],[f45,f23]) ).
fof(f57,plain,
( $false
| spl0_1
| ~ spl0_7
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f56,f16]) ).
fof(f58,plain,
( spl0_1
| ~ spl0_7
| ~ spl0_3 ),
inference(contradiction_clause,[status(thm)],[f57]) ).
fof(f59,plain,
$false,
inference(sat_refutation,[status(thm)],[f21,f26,f28,f51,f53,f55,f58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET838-2 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.30 % Computer : n009.cluster.edu
% 0.08/0.30 % Model : x86_64 x86_64
% 0.08/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.30 % Memory : 8042.1875MB
% 0.08/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.30 % CPULimit : 300
% 0.08/0.30 % WCLimit : 300
% 0.08/0.30 % DateTime : Tue May 30 10:17:31 EDT 2023
% 0.08/0.30 % CPUTime :
% 0.08/0.31 % Drodi V3.5.1
% 0.14/0.32 % Refutation found
% 0.14/0.32 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.53 % Elapsed time: 0.011956 seconds
% 0.14/0.53 % CPU time: 0.010442 seconds
% 0.14/0.53 % Memory used: 2.273 MB
%------------------------------------------------------------------------------