TSTP Solution File: SWV412+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV412+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:14:21 EDT 2024
% Result : Theorem 0.42s 1.11s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f19,axiom,
! [X0,X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l48_li3839) ).
fof(f20,conjecture,
! [X0,X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l48_co) ).
fof(f21,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X3) ),
inference(negated_conjecture,[],[f20]) ).
fof(f30,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ strictly_less_than(X2,X3)
| ~ pair_in_list(X0,X1,X2) ),
inference(ennf_transformation,[],[f19]) ).
fof(f31,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ strictly_less_than(X2,X3)
| ~ pair_in_list(X0,X1,X2) ),
inference(flattening,[],[f30]) ).
fof(f32,plain,
? [X0,X1,X2,X3] :
( ~ pair_in_list(update_slb(X0,X3),X1,X3)
& strictly_less_than(X2,X3)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) ),
inference(ennf_transformation,[],[f21]) ).
fof(f33,plain,
? [X0,X1,X2,X3] :
( ~ pair_in_list(update_slb(X0,X3),X1,X3)
& strictly_less_than(X2,X3)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) ),
inference(flattening,[],[f32]) ).
fof(f40,plain,
( ? [X0,X1,X2,X3] :
( ~ pair_in_list(update_slb(X0,X3),X1,X3)
& strictly_less_than(X2,X3)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) )
=> ( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3)
& strictly_less_than(sK2,sK3)
& strictly_less_than(sK1,sK3)
& pair_in_list(sK0,sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3)
& strictly_less_than(sK2,sK3)
& strictly_less_than(sK1,sK3)
& pair_in_list(sK0,sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f33,f40]) ).
fof(f67,plain,
! [X2,X3,X0,X1] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ strictly_less_than(X2,X3)
| ~ pair_in_list(X0,X1,X2) ),
inference(cnf_transformation,[],[f31]) ).
fof(f68,plain,
pair_in_list(sK0,sK1,sK2),
inference(cnf_transformation,[],[f41]) ).
fof(f70,plain,
strictly_less_than(sK2,sK3),
inference(cnf_transformation,[],[f41]) ).
fof(f71,plain,
~ pair_in_list(update_slb(sK0,sK3),sK1,sK3),
inference(cnf_transformation,[],[f41]) ).
cnf(c_74,plain,
( ~ pair_in_list(X0,X1,X2)
| ~ strictly_less_than(X2,X3)
| pair_in_list(update_slb(X0,X3),X1,X3) ),
inference(cnf_transformation,[],[f67]) ).
cnf(c_75,negated_conjecture,
~ pair_in_list(update_slb(sK0,sK3),sK1,sK3),
inference(cnf_transformation,[],[f71]) ).
cnf(c_76,negated_conjecture,
strictly_less_than(sK2,sK3),
inference(cnf_transformation,[],[f70]) ).
cnf(c_78,negated_conjecture,
pair_in_list(sK0,sK1,sK2),
inference(cnf_transformation,[],[f68]) ).
cnf(c_788,plain,
update_slb(sK0,sK3) = sP0_iProver_def,
definition ).
cnf(c_789,negated_conjecture,
pair_in_list(sK0,sK1,sK2),
inference(demodulation,[status(thm)],[c_78]) ).
cnf(c_791,negated_conjecture,
strictly_less_than(sK2,sK3),
inference(demodulation,[status(thm)],[c_76]) ).
cnf(c_792,negated_conjecture,
~ pair_in_list(sP0_iProver_def,sK1,sK3),
inference(demodulation,[status(thm)],[c_75,c_788]) ).
cnf(c_1252,plain,
( ~ strictly_less_than(sK2,X0)
| pair_in_list(update_slb(sK0,X0),sK1,X0) ),
inference(superposition,[status(thm)],[c_789,c_74]) ).
cnf(c_1355,plain,
( ~ strictly_less_than(sK2,sK3)
| pair_in_list(sP0_iProver_def,sK1,sK3) ),
inference(superposition,[status(thm)],[c_788,c_1252]) ).
cnf(c_1357,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1355,c_792,c_791]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV412+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n019.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 00:26:59 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 0.42/1.11 % SZS status Started for theBenchmark.p
% 0.42/1.11 % SZS status Theorem for theBenchmark.p
% 0.42/1.11
% 0.42/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.42/1.11
% 0.42/1.11 ------ iProver source info
% 0.42/1.11
% 0.42/1.11 git: date: 2024-05-02 19:28:25 +0000
% 0.42/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.42/1.11 git: non_committed_changes: false
% 0.42/1.11
% 0.42/1.11 ------ Parsing...
% 0.42/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.42/1.11
% 0.42/1.11 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 0.42/1.11
% 0.42/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.42/1.11
% 0.42/1.11 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.42/1.11 ------ Proving...
% 0.42/1.11 ------ Problem Properties
% 0.42/1.11
% 0.42/1.11
% 0.42/1.11 clauses 27
% 0.42/1.11 conjectures 4
% 0.42/1.11 EPR 10
% 0.42/1.11 Horn 20
% 0.42/1.11 unary 15
% 0.42/1.11 binary 5
% 0.42/1.11 lits 46
% 0.42/1.11 lits eq 14
% 0.42/1.11 fd_pure 0
% 0.42/1.11 fd_pseudo 0
% 0.42/1.11 fd_cond 0
% 0.42/1.11 fd_pseudo_cond 5
% 0.42/1.11 AC symbols 0
% 0.42/1.11
% 0.42/1.11 ------ Schedule dynamic 5 is on
% 0.42/1.11
% 0.42/1.11 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.42/1.11
% 0.42/1.11
% 0.42/1.11 ------
% 0.42/1.11 Current options:
% 0.42/1.11 ------
% 0.42/1.11
% 0.42/1.11
% 0.42/1.11
% 0.42/1.11
% 0.42/1.11 ------ Proving...
% 0.42/1.11
% 0.42/1.11
% 0.42/1.11 % SZS status Theorem for theBenchmark.p
% 0.42/1.11
% 0.42/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/1.11
% 0.42/1.11
%------------------------------------------------------------------------------