TSTP Solution File: SET864-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET864-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n024.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:25 EDT 2023
% Result : Unsatisfiable 0.20s 0.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 71 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 73 ( 36 ~; 33 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 23 (; 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f310,axiom,
! [V_A,T_a] : c_lessequals(V_A,V_A,tc_set(T_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1359,axiom,
! [V_u,V_S,T_a,V_c] :
( ~ c_in(V_u,V_S,tc_set(T_a))
| ~ c_in(V_c,c_Zorn_Omaxchain(V_S,T_a),tc_set(tc_set(T_a)))
| ~ c_lessequals(c_Union(V_c,T_a),V_u,tc_set(T_a))
| c_Union(V_c,T_a) = V_u ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1361,negated_conjecture,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1363,negated_conjecture,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1364,negated_conjecture,
! [V_U] :
( c_in(v_x(V_U),v_S,tc_set(t_a))
| ~ c_in(V_U,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1365,negated_conjecture,
! [V_U] :
( c_lessequals(V_U,v_x(V_U),tc_set(t_a))
| ~ c_in(V_U,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1366,negated_conjecture,
! [V_U] :
( V_U != v_x(V_U)
| ~ c_in(V_U,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f1785,plain,
! [X0,X1] : c_lessequals(X0,X0,tc_set(X1)),
inference(cnf_transformation,[status(esa)],[f310]) ).
fof(f2843,plain,
! [V_u,T_a,V_c] :
( ! [V_S] :
( ~ c_in(V_u,V_S,tc_set(T_a))
| ~ c_in(V_c,c_Zorn_Omaxchain(V_S,T_a),tc_set(tc_set(T_a))) )
| ~ c_lessequals(c_Union(V_c,T_a),V_u,tc_set(T_a))
| c_Union(V_c,T_a) = V_u ),
inference(miniscoping,[status(esa)],[f1359]) ).
fof(f2844,plain,
! [X0,X1,X2,X3] :
( ~ c_in(X0,X1,tc_set(X2))
| ~ c_in(X3,c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2)))
| ~ c_lessequals(c_Union(X3,X2),X0,tc_set(X2))
| c_Union(X3,X2) = X0 ),
inference(cnf_transformation,[status(esa)],[f2843]) ).
fof(f2846,plain,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnf_transformation,[status(esa)],[f1361]) ).
fof(f2848,plain,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
inference(cnf_transformation,[status(esa)],[f1363]) ).
fof(f2849,plain,
! [X0] :
( c_in(v_x(X0),v_S,tc_set(t_a))
| ~ c_in(X0,v_S,tc_set(t_a)) ),
inference(cnf_transformation,[status(esa)],[f1364]) ).
fof(f2850,plain,
! [X0] :
( c_lessequals(X0,v_x(X0),tc_set(t_a))
| ~ c_in(X0,v_S,tc_set(t_a)) ),
inference(cnf_transformation,[status(esa)],[f1365]) ).
fof(f2851,plain,
! [X0] :
( X0 != v_x(X0)
| ~ c_in(X0,v_S,tc_set(t_a)) ),
inference(cnf_transformation,[status(esa)],[f1366]) ).
fof(f2860,plain,
! [X0] :
( ~ c_in(X0,v_S,tc_set(t_a))
| ~ c_lessequals(c_Union(v_c,t_a),X0,tc_set(t_a))
| c_Union(v_c,t_a) = X0 ),
inference(resolution,[status(thm)],[f2844,f2846]) ).
fof(f2861,plain,
( spl0_0
<=> c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a)) ),
introduced(split_symbol_definition) ).
fof(f2863,plain,
( ~ c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a))
| spl0_0 ),
inference(component_clause,[status(thm)],[f2861]) ).
fof(f2864,plain,
( spl0_1
<=> c_Union(v_c,t_a) = v_x(c_Union(v_c,t_a)) ),
introduced(split_symbol_definition) ).
fof(f2865,plain,
( c_Union(v_c,t_a) = v_x(c_Union(v_c,t_a))
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f2864]) ).
fof(f2867,plain,
( spl0_2
<=> c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)) ),
introduced(split_symbol_definition) ).
fof(f2869,plain,
( ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))
| spl0_2 ),
inference(component_clause,[status(thm)],[f2867]) ).
fof(f2870,plain,
( ~ c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a))
| c_Union(v_c,t_a) = v_x(c_Union(v_c,t_a))
| ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)) ),
inference(resolution,[status(thm)],[f2860,f2850]) ).
fof(f2871,plain,
( ~ spl0_0
| spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f2870,f2861,f2864,f2867]) ).
fof(f2872,plain,
( spl0_3
<=> c_Union(v_c,t_a) = c_Union(v_c,t_a) ),
introduced(split_symbol_definition) ).
fof(f2875,plain,
( ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))
| c_Union(v_c,t_a) = c_Union(v_c,t_a) ),
inference(resolution,[status(thm)],[f2860,f1785]) ).
fof(f2876,plain,
( ~ spl0_2
| spl0_3 ),
inference(split_clause,[status(thm)],[f2875,f2867,f2872]) ).
fof(f2877,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f2869,f2848]) ).
fof(f2878,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f2877]) ).
fof(f2880,plain,
( ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))
| spl0_0 ),
inference(resolution,[status(thm)],[f2863,f2849]) ).
fof(f2881,plain,
( ~ spl0_2
| spl0_0 ),
inference(split_clause,[status(thm)],[f2880,f2867,f2861]) ).
fof(f2893,plain,
( c_Union(v_c,t_a) != c_Union(v_c,t_a)
| ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))
| ~ spl0_1 ),
inference(paramodulation,[status(thm)],[f2865,f2851]) ).
fof(f2894,plain,
( ~ spl0_3
| ~ spl0_2
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f2893,f2872,f2867,f2864]) ).
fof(f2895,plain,
$false,
inference(sat_refutation,[status(thm)],[f2871,f2876,f2878,f2881,f2894]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET864-1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n024.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 May 30 10:21:48 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.39 % Drodi V3.5.1
% 0.20/0.40 % Refutation found
% 0.20/0.40 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.20/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.42 % Elapsed time: 0.068666 seconds
% 0.20/0.42 % CPU time: 0.107320 seconds
% 0.20/0.42 % Memory used: 25.952 MB
%------------------------------------------------------------------------------