TSTP Solution File: NUM387+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM387+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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 02:49:08 EDT 2024
% Result : Theorem 2.42s 1.19s
% Output : CNFRefutation 2.42s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f5,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f6,axiom,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(f26,axiom,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f27,conjecture,
! [X0] : succ(X0) != X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_ordinal1) ).
fof(f28,negated_conjecture,
~ ! [X0] : succ(X0) != X0,
inference(negated_conjecture,[],[f27]) ).
fof(f42,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f51,plain,
? [X0] : succ(X0) = X0,
inference(ennf_transformation,[],[f28]) ).
fof(f80,plain,
( ? [X0] : succ(X0) = X0
=> sK11 = succ(sK11) ),
introduced(choice_axiom,[]) ).
fof(f81,plain,
sK11 = succ(sK11),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f51,f80]) ).
fof(f82,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f87,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f88,plain,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f118,plain,
! [X0] : in(X0,succ(X0)),
inference(cnf_transformation,[],[f26]) ).
fof(f119,plain,
sK11 = succ(sK11),
inference(cnf_transformation,[],[f81]) ).
fof(f127,plain,
! [X0] : in(X0,set_union2(X0,singleton(X0))),
inference(definition_unfolding,[],[f118,f88]) ).
fof(f128,plain,
sK11 = set_union2(sK11,singleton(sK11)),
inference(definition_unfolding,[],[f119,f88]) ).
cnf(c_49,plain,
( ~ in(X0,X1)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f82]) ).
cnf(c_52,plain,
set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f87]) ).
cnf(c_82,plain,
in(X0,set_union2(X0,singleton(X0))),
inference(cnf_transformation,[],[f127]) ).
cnf(c_83,negated_conjecture,
set_union2(sK11,singleton(sK11)) = sK11,
inference(cnf_transformation,[],[f128]) ).
cnf(c_364,plain,
singleton(sK11) = sP0_iProver_def,
definition ).
cnf(c_365,plain,
set_union2(sK11,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_366,negated_conjecture,
sP1_iProver_def = sK11,
inference(demodulation,[status(thm)],[c_83,c_364,c_365]) ).
cnf(c_559,plain,
singleton(sP1_iProver_def) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_364,c_366]) ).
cnf(c_560,plain,
set_union2(sP1_iProver_def,sP0_iProver_def) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_365,c_366]) ).
cnf(c_561,plain,
set_union2(sP0_iProver_def,sP1_iProver_def) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_560,c_52]) ).
cnf(c_563,plain,
in(sP1_iProver_def,set_union2(sP1_iProver_def,sP0_iProver_def)),
inference(superposition,[status(thm)],[c_559,c_82]) ).
cnf(c_565,plain,
in(sP1_iProver_def,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_563,c_52,c_561]) ).
cnf(c_606,plain,
~ in(sP1_iProver_def,sP1_iProver_def),
inference(superposition,[status(thm)],[c_565,c_49]) ).
cnf(c_607,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_606,c_565]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM387+1 : TPTP v8.1.2. Released v3.2.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 20:00:15 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 2.42/1.19 % SZS status Started for theBenchmark.p
% 2.42/1.19 % SZS status Theorem for theBenchmark.p
% 2.42/1.19
% 2.42/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.42/1.19
% 2.42/1.19 ------ iProver source info
% 2.42/1.19
% 2.42/1.19 git: date: 2024-05-02 19:28:25 +0000
% 2.42/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.42/1.19 git: non_committed_changes: false
% 2.42/1.19
% 2.42/1.19 ------ Parsing...
% 2.42/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.42/1.19
% 2.42/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 20 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 2.42/1.19
% 2.42/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.42/1.19
% 2.42/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.42/1.19 ------ Proving...
% 2.42/1.19 ------ Problem Properties
% 2.42/1.19
% 2.42/1.19
% 2.42/1.19 clauses 21
% 2.42/1.19 conjectures 1
% 2.42/1.19 EPR 11
% 2.42/1.19 Horn 20
% 2.42/1.19 unary 14
% 2.42/1.19 binary 6
% 2.42/1.19 lits 29
% 2.42/1.19 lits eq 8
% 2.42/1.19 fd_pure 0
% 2.42/1.19 fd_pseudo 0
% 2.42/1.19 fd_cond 1
% 2.42/1.19 fd_pseudo_cond 1
% 2.42/1.19 AC symbols 0
% 2.42/1.19
% 2.42/1.19 ------ Schedule dynamic 5 is on
% 2.42/1.19
% 2.42/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.42/1.19
% 2.42/1.19
% 2.42/1.19 ------
% 2.42/1.19 Current options:
% 2.42/1.19 ------
% 2.42/1.19
% 2.42/1.19
% 2.42/1.19
% 2.42/1.19
% 2.42/1.19 ------ Proving...
% 2.42/1.19
% 2.42/1.19
% 2.42/1.19 % SZS status Theorem for theBenchmark.p
% 2.42/1.19
% 2.42/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.42/1.19
% 2.42/1.19
%------------------------------------------------------------------------------