TSTP Solution File: SET851-2 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SET851-2 : TPTP v8.1.2. Released v3.2.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:40:33 EDT 2024
% Result : Unsatisfiable 0.13s 0.35s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 39 ( 14 unt; 0 def)
% Number of atoms : 72 ( 5 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 62 ( 29 ~; 28 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 18 ( 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [V_A,T_a] : c_lessequals(V_A,V_A,tc_set(T_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [V_x,V_y,T_a,V_S] :
( ~ c_lessequals(V_x,V_y,tc_set(tc_set(T_a)))
| c_lessequals(V_x,c_Zorn_Osucc(V_S,V_y,T_a),tc_set(tc_set(T_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a)))
| c_lessequals(v_x,v_m,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
! [V_U] :
( c_lessequals(c_Zorn_Osucc(v_S,V_U,t_a),v_m,tc_set(tc_set(t_a)))
| V_U = v_m
| ~ c_lessequals(V_U,v_m,tc_set(tc_set(t_a)))
| ~ c_in(V_U,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,plain,
! [X0,X1] : c_lessequals(X0,X0,tc_set(X1)),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f9,plain,
! [V_x,V_y,T_a] :
( ~ c_lessequals(V_x,V_y,tc_set(tc_set(T_a)))
| ! [V_S] : c_lessequals(V_x,c_Zorn_Osucc(V_S,V_y,T_a),tc_set(tc_set(T_a))) ),
inference(miniscoping,[status(esa)],[f2]) ).
fof(f10,plain,
! [X0,X1,X2,X3] :
( ~ c_lessequals(X0,X1,tc_set(tc_set(X2)))
| c_lessequals(X0,c_Zorn_Osucc(X3,X1,X2),tc_set(tc_set(X2))) ),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f11,plain,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f12,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f13,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f14,plain,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a)))
| c_lessequals(v_x,v_m,tc_set(tc_set(t_a))) ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f15,plain,
! [X0] :
( c_lessequals(c_Zorn_Osucc(v_S,X0,t_a),v_m,tc_set(tc_set(t_a)))
| X0 = v_m
| ~ c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f16,plain,
( spl0_0
<=> c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))) ),
introduced(split_symbol_definition) ).
fof(f17,plain,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a)))
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f16]) ).
fof(f19,plain,
( spl0_1
<=> c_lessequals(v_x,v_m,tc_set(tc_set(t_a))) ),
introduced(split_symbol_definition) ).
fof(f20,plain,
( c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f19]) ).
fof(f22,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f14,f16,f19]) ).
fof(f34,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))),
inference(resolution,[status(thm)],[f10,f13]) ).
fof(f35,plain,
( $false
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f17,f34]) ).
fof(f36,plain,
~ spl0_0,
inference(contradiction_clause,[status(thm)],[f35]) ).
fof(f37,plain,
( spl0_5
<=> c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))) ),
introduced(split_symbol_definition) ).
fof(f38,plain,
( c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a)))
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f37]) ).
fof(f40,plain,
( spl0_6
<=> v_x = v_m ),
introduced(split_symbol_definition) ).
fof(f41,plain,
( v_x = v_m
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f40]) ).
fof(f43,plain,
( spl0_7
<=> c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
introduced(split_symbol_definition) ).
fof(f45,plain,
( ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| spl0_7 ),
inference(component_clause,[status(thm)],[f43]) ).
fof(f46,plain,
( c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a)))
| v_x = v_m
| ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f20,f15]) ).
fof(f47,plain,
( spl0_5
| spl0_6
| ~ spl0_7
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f46,f37,f40,f43,f19]) ).
fof(f48,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f45,f11]) ).
fof(f49,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f48]) ).
fof(f50,plain,
( $false
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f38,f12]) ).
fof(f51,plain,
~ spl0_5,
inference(contradiction_clause,[status(thm)],[f50]) ).
fof(f59,plain,
( ~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a)))
| ~ spl0_6 ),
inference(backward_demodulation,[status(thm)],[f41,f13]) ).
fof(f60,plain,
( $false
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f59,f8]) ).
fof(f61,plain,
~ spl0_6,
inference(contradiction_clause,[status(thm)],[f60]) ).
fof(f62,plain,
$false,
inference(sat_refutation,[status(thm)],[f22,f36,f47,f49,f51,f61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET851-2 : TPTP v8.1.2. Released v3.2.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:43:27 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.6.0
% 0.13/0.35 % Refutation found
% 0.13/0.35 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.36 % Elapsed time: 0.019040 seconds
% 0.13/0.36 % CPU time: 0.027523 seconds
% 0.13/0.36 % Total memory used: 10.976 MB
% 0.13/0.36 % Net memory used: 10.809 MB
%------------------------------------------------------------------------------