TSTP Solution File: SEU307+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU307+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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 : Fri May 3 03:05:25 EDT 2024
% Result : Theorem 3.63s 1.13s
% Output : CNFRefutation 3.63s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f44,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f47,axiom,
! [X0,X1,X2] :
( ( element(X2,powerset(X0))
& element(X1,powerset(X0)) )
=> subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_subset_1) ).
fof(f56,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f57,axiom,
! [X0] :
( one_sorted_str(X0)
=> cast_as_carrier_subset(X0) = the_carrier(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(f58,conjecture,
! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_pre_topc) ).
fof(f59,negated_conjecture,
~ ! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) = X1 ) ),
inference(negated_conjecture,[],[f58]) ).
fof(f60,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f62,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f44]) ).
fof(f113,plain,
! [X0,X1,X2] :
( subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2)
| ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f47]) ).
fof(f114,plain,
! [X0,X1,X2] :
( subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2)
| ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0)) ),
inference(flattening,[],[f113]) ).
fof(f118,plain,
! [X0] :
( cast_as_carrier_subset(X0) = the_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f119,plain,
? [X0] :
( ? [X1] :
( subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) != X1
& element(X1,powerset(the_carrier(X0))) )
& one_sorted_str(X0) ),
inference(ennf_transformation,[],[f59]) ).
fof(f120,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f60]) ).
fof(f131,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f56]) ).
fof(f132,plain,
( ? [X0] :
( ? [X1] :
( subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) != X1
& element(X1,powerset(the_carrier(X0))) )
& one_sorted_str(X0) )
=> ( ? [X1] :
( subset_intersection2(the_carrier(sK5),X1,cast_as_carrier_subset(sK5)) != X1
& element(X1,powerset(the_carrier(sK5))) )
& one_sorted_str(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X1] :
( subset_intersection2(the_carrier(sK5),X1,cast_as_carrier_subset(sK5)) != X1
& element(X1,powerset(the_carrier(sK5))) )
=> ( sK6 != subset_intersection2(the_carrier(sK5),sK6,cast_as_carrier_subset(sK5))
& element(sK6,powerset(the_carrier(sK5))) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( sK6 != subset_intersection2(the_carrier(sK5),sK6,cast_as_carrier_subset(sK5))
& element(sK6,powerset(the_carrier(sK5)))
& one_sorted_str(sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f119,f133,f132]) ).
fof(f218,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f62]) ).
fof(f221,plain,
! [X2,X0,X1] :
( subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2)
| ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0)) ),
inference(cnf_transformation,[],[f114]) ).
fof(f225,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f131]) ).
fof(f226,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f131]) ).
fof(f227,plain,
! [X0] :
( cast_as_carrier_subset(X0) = the_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f228,plain,
one_sorted_str(sK5),
inference(cnf_transformation,[],[f134]) ).
fof(f229,plain,
element(sK6,powerset(the_carrier(sK5))),
inference(cnf_transformation,[],[f134]) ).
fof(f230,plain,
sK6 != subset_intersection2(the_carrier(sK5),sK6,cast_as_carrier_subset(sK5)),
inference(cnf_transformation,[],[f134]) ).
fof(f231,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f120]) ).
cnf(c_132,plain,
subset(X0,X0),
inference(cnf_transformation,[],[f218]) ).
cnf(c_135,plain,
( ~ element(X0,powerset(X1))
| ~ element(X2,powerset(X1))
| subset_intersection2(X1,X0,X2) = set_intersection2(X0,X2) ),
inference(cnf_transformation,[],[f221]) ).
cnf(c_139,plain,
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f226]) ).
cnf(c_140,plain,
( ~ element(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f225]) ).
cnf(c_141,plain,
( ~ one_sorted_str(X0)
| cast_as_carrier_subset(X0) = the_carrier(X0) ),
inference(cnf_transformation,[],[f227]) ).
cnf(c_142,negated_conjecture,
subset_intersection2(the_carrier(sK5),sK6,cast_as_carrier_subset(sK5)) != sK6,
inference(cnf_transformation,[],[f230]) ).
cnf(c_143,negated_conjecture,
element(sK6,powerset(the_carrier(sK5))),
inference(cnf_transformation,[],[f229]) ).
cnf(c_144,negated_conjecture,
one_sorted_str(sK5),
inference(cnf_transformation,[],[f228]) ).
cnf(c_145,plain,
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f231]) ).
cnf(c_181,plain,
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(prop_impl_just,[status(thm)],[c_139]) ).
cnf(c_301,plain,
( ~ one_sorted_str(X0)
| cast_as_carrier_subset(X0) = the_carrier(X0) ),
inference(prop_impl_just,[status(thm)],[c_141]) ).
cnf(c_473,plain,
( ~ element(X0,powerset(X1))
| ~ subset(X2,X1)
| subset_intersection2(X1,X2,X0) = set_intersection2(X2,X0) ),
inference(bin_hyper_res,[status(thm)],[c_135,c_181]) ).
cnf(c_1223,plain,
( X0 != sK5
| cast_as_carrier_subset(X0) = the_carrier(X0) ),
inference(resolution_lifted,[status(thm)],[c_301,c_144]) ).
cnf(c_1224,plain,
cast_as_carrier_subset(sK5) = the_carrier(sK5),
inference(unflattening,[status(thm)],[c_1223]) ).
cnf(c_1388,plain,
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(prop_impl_just,[status(thm)],[c_139]) ).
cnf(c_1464,plain,
( ~ subset(X0,X1)
| ~ subset(X2,X1)
| subset_intersection2(X1,X2,X0) = set_intersection2(X2,X0) ),
inference(bin_hyper_res,[status(thm)],[c_473,c_1388]) ).
cnf(c_1628,plain,
subset_intersection2(the_carrier(sK5),sK6,the_carrier(sK5)) != sK6,
inference(light_normalisation,[status(thm)],[c_142,c_1224]) ).
cnf(c_1914,plain,
the_carrier(sK5) = sP0_iProver_def,
definition ).
cnf(c_1915,plain,
powerset(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_1916,negated_conjecture,
element(sK6,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_143,c_1914,c_1915]) ).
cnf(c_2481,plain,
subset_intersection2(sP0_iProver_def,sK6,sP0_iProver_def) != sK6,
inference(light_normalisation,[status(thm)],[c_1628,c_1914]) ).
cnf(c_2550,plain,
( ~ element(X0,sP1_iProver_def)
| subset(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_1915,c_140]) ).
cnf(c_2571,plain,
subset(sK6,sP0_iProver_def),
inference(superposition,[status(thm)],[c_1916,c_2550]) ).
cnf(c_2629,plain,
set_intersection2(sK6,sP0_iProver_def) = sK6,
inference(superposition,[status(thm)],[c_2571,c_145]) ).
cnf(c_6930,plain,
( ~ subset(X0,X1)
| subset_intersection2(X1,X0,X1) = set_intersection2(X0,X1) ),
inference(superposition,[status(thm)],[c_132,c_1464]) ).
cnf(c_7060,plain,
subset_intersection2(sP0_iProver_def,sK6,sP0_iProver_def) = set_intersection2(sK6,sP0_iProver_def),
inference(superposition,[status(thm)],[c_2571,c_6930]) ).
cnf(c_7067,plain,
subset_intersection2(sP0_iProver_def,sK6,sP0_iProver_def) = sK6,
inference(light_normalisation,[status(thm)],[c_7060,c_2629]) ).
cnf(c_7068,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7067,c_2481]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU307+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 17:58:33 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.63/1.13 % SZS status Started for theBenchmark.p
% 3.63/1.13 % SZS status Theorem for theBenchmark.p
% 3.63/1.13
% 3.63/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.63/1.13
% 3.63/1.13 ------ iProver source info
% 3.63/1.13
% 3.63/1.13 git: date: 2024-05-02 19:28:25 +0000
% 3.63/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.63/1.13 git: non_committed_changes: false
% 3.63/1.13
% 3.63/1.13 ------ Parsing...
% 3.63/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.63/1.13
% 3.63/1.13 ------ Preprocessing... sup_sim: 0 sf_s rm: 70 0s sf_e pe_s pe:1:0s pe_e sup_sim: 3 sf_s rm: 7 0s sf_e pe_s pe_e
% 3.63/1.13
% 3.63/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.63/1.13
% 3.63/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.63/1.13 ------ Proving...
% 3.63/1.13 ------ Problem Properties
% 3.63/1.13
% 3.63/1.13
% 3.63/1.13 clauses 35
% 3.63/1.13 conjectures 1
% 3.63/1.13 EPR 12
% 3.63/1.13 Horn 33
% 3.63/1.13 unary 18
% 3.63/1.13 binary 9
% 3.63/1.13 lits 60
% 3.63/1.13 lits eq 14
% 3.63/1.13 fd_pure 0
% 3.63/1.13 fd_pseudo 0
% 3.63/1.13 fd_cond 1
% 3.63/1.13 fd_pseudo_cond 1
% 3.63/1.13 AC symbols 0
% 3.63/1.13
% 3.63/1.13 ------ Schedule dynamic 5 is on
% 3.63/1.13
% 3.63/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.63/1.13
% 3.63/1.13
% 3.63/1.13 ------
% 3.63/1.13 Current options:
% 3.63/1.13 ------
% 3.63/1.13
% 3.63/1.13
% 3.63/1.13
% 3.63/1.13
% 3.63/1.13 ------ Proving...
% 3.63/1.13
% 3.63/1.13
% 3.63/1.13 % SZS status Theorem for theBenchmark.p
% 3.63/1.13
% 3.63/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.63/1.13
% 3.63/1.14
%------------------------------------------------------------------------------