TSTP Solution File: SEU116+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU116+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:04:32 EDT 2024
% Result : Theorem 0.45s 1.15s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X0,X1] :
( element(X1,finite_subsets(X0))
=> finite(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc3_finsub_1) ).
fof(f31,conjecture,
! [X0,X1] :
( element(X1,finite_subsets(X0))
=> finite(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t30_finsub_1) ).
fof(f32,negated_conjecture,
~ ! [X0,X1] :
( element(X1,finite_subsets(X0))
=> finite(X1) ),
inference(negated_conjecture,[],[f31]) ).
fof(f59,plain,
! [X0,X1] :
( finite(X1)
| ~ element(X1,finite_subsets(X0)) ),
inference(ennf_transformation,[],[f21]) ).
fof(f63,plain,
? [X0,X1] :
( ~ finite(X1)
& element(X1,finite_subsets(X0)) ),
inference(ennf_transformation,[],[f32]) ).
fof(f84,plain,
( ? [X0,X1] :
( ~ finite(X1)
& element(X1,finite_subsets(X0)) )
=> ( ~ finite(sK11)
& element(sK11,finite_subsets(sK10)) ) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
( ~ finite(sK11)
& element(sK11,finite_subsets(sK10)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11])],[f63,f84]) ).
fof(f113,plain,
! [X0,X1] :
( finite(X1)
| ~ element(X1,finite_subsets(X0)) ),
inference(cnf_transformation,[],[f59]) ).
fof(f135,plain,
element(sK11,finite_subsets(sK10)),
inference(cnf_transformation,[],[f85]) ).
fof(f136,plain,
~ finite(sK11),
inference(cnf_transformation,[],[f85]) ).
cnf(c_76,plain,
( ~ element(X0,finite_subsets(X1))
| finite(X0) ),
inference(cnf_transformation,[],[f113]) ).
cnf(c_98,negated_conjecture,
~ finite(sK11),
inference(cnf_transformation,[],[f136]) ).
cnf(c_99,negated_conjecture,
element(sK11,finite_subsets(sK10)),
inference(cnf_transformation,[],[f135]) ).
cnf(c_614,plain,
finite_subsets(sK10) = sP0_iProver_def,
definition ).
cnf(c_615,negated_conjecture,
element(sK11,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_99,c_614]) ).
cnf(c_616,negated_conjecture,
~ finite(sK11),
inference(demodulation,[status(thm)],[c_98]) ).
cnf(c_997,plain,
( ~ element(X0,sP0_iProver_def)
| finite(X0) ),
inference(superposition,[status(thm)],[c_614,c_76]) ).
cnf(c_1008,plain,
finite(sK11),
inference(superposition,[status(thm)],[c_615,c_997]) ).
cnf(c_1009,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1008,c_616]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU116+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n013.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 17:33:34 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.45/1.15 % SZS status Started for theBenchmark.p
% 0.45/1.15 % SZS status Theorem for theBenchmark.p
% 0.45/1.15
% 0.45/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.45/1.15
% 0.45/1.15 ------ iProver source info
% 0.45/1.15
% 0.45/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.45/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.45/1.15 git: non_committed_changes: false
% 0.45/1.15
% 0.45/1.15 ------ Parsing...
% 0.45/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.45/1.15
% 0.45/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 16 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 0.45/1.15
% 0.45/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.15
% 0.45/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.15 ------ Proving...
% 0.45/1.15 ------ Problem Properties
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 clauses 37
% 0.45/1.15 conjectures 2
% 0.45/1.15 EPR 15
% 0.45/1.15 Horn 31
% 0.45/1.15 unary 18
% 0.45/1.15 binary 14
% 0.45/1.15 lits 61
% 0.45/1.15 lits eq 3
% 0.45/1.15 fd_pure 0
% 0.45/1.15 fd_pseudo 0
% 0.45/1.15 fd_cond 1
% 0.45/1.15 fd_pseudo_cond 1
% 0.45/1.15 AC symbols 0
% 0.45/1.15
% 0.45/1.15 ------ Schedule dynamic 5 is on
% 0.45/1.15
% 0.45/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 ------
% 0.45/1.15 Current options:
% 0.45/1.15 ------
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 ------ Proving...
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 % SZS status Theorem for theBenchmark.p
% 0.45/1.15
% 0.45/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.15
% 0.45/1.15
%------------------------------------------------------------------------------