TSTP Solution File: SWV413+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV413+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:22 EDT 2024
% Result : Theorem 2.50s 1.15s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 71 ( 2 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 81 ( 33 ~; 22 |; 22 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 30 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f19,axiom,
! [X0,X1,X2,X3] :
( ( less_than(X3,X2)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l49_li3637) ).
fof(f20,conjecture,
! [X0,X1,X2,X3] :
( ( less_than(X3,X2)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) )
=> ? [X4] :
( less_than(X3,X4)
& pair_in_list(update_slb(X0,X3),X1,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l49_co) ).
fof(f21,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( less_than(X3,X2)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) )
=> ? [X4] :
( less_than(X3,X4)
& pair_in_list(update_slb(X0,X3),X1,X4) ) ),
inference(negated_conjecture,[],[f20]) ).
fof(f30,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ less_than(X3,X2)
| ~ 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,X2)
| ~ less_than(X3,X2)
| ~ pair_in_list(X0,X1,X2) ),
inference(flattening,[],[f30]) ).
fof(f32,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(X3,X4)
| ~ pair_in_list(update_slb(X0,X3),X1,X4) )
& less_than(X3,X2)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) ),
inference(ennf_transformation,[],[f21]) ).
fof(f33,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(X3,X4)
| ~ pair_in_list(update_slb(X0,X3),X1,X4) )
& less_than(X3,X2)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) ),
inference(flattening,[],[f32]) ).
fof(f40,plain,
( ? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(X3,X4)
| ~ pair_in_list(update_slb(X0,X3),X1,X4) )
& less_than(X3,X2)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) )
=> ( ! [X4] :
( ~ less_than(sK3,X4)
| ~ pair_in_list(update_slb(sK0,sK3),sK1,X4) )
& less_than(sK3,sK2)
& strictly_less_than(sK1,sK3)
& pair_in_list(sK0,sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
( ! [X4] :
( ~ less_than(sK3,X4)
| ~ pair_in_list(update_slb(sK0,sK3),sK1,X4) )
& less_than(sK3,sK2)
& 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,X2)
| ~ less_than(X3,X2)
| ~ 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,
less_than(sK3,sK2),
inference(cnf_transformation,[],[f41]) ).
fof(f71,plain,
! [X4] :
( ~ less_than(sK3,X4)
| ~ pair_in_list(update_slb(sK0,sK3),sK1,X4) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_74,plain,
( ~ pair_in_list(X0,X1,X2)
| ~ less_than(X3,X2)
| pair_in_list(update_slb(X0,X3),X1,X2) ),
inference(cnf_transformation,[],[f67]) ).
cnf(c_75,negated_conjecture,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,X0)
| ~ less_than(sK3,X0) ),
inference(cnf_transformation,[],[f71]) ).
cnf(c_76,negated_conjecture,
less_than(sK3,sK2),
inference(cnf_transformation,[],[f70]) ).
cnf(c_78,negated_conjecture,
pair_in_list(sK0,sK1,sK2),
inference(cnf_transformation,[],[f68]) ).
cnf(c_386,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,X0)
| ~ less_than(sK3,X0) ),
inference(prop_impl_just,[status(thm)],[c_75]) ).
cnf(c_736,plain,
( X0 != sK2
| sK3 != sK3
| ~ pair_in_list(update_slb(sK0,sK3),sK1,X0) ),
inference(resolution_lifted,[status(thm)],[c_386,c_76]) ).
cnf(c_737,plain,
~ pair_in_list(update_slb(sK0,sK3),sK1,sK2),
inference(unflattening,[status(thm)],[c_736]) ).
cnf(c_1651,plain,
( ~ pair_in_list(sK0,sK1,sK2)
| ~ less_than(X0,sK2)
| pair_in_list(update_slb(sK0,X0),sK1,sK2) ),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_1975,plain,
( ~ pair_in_list(sK0,sK1,sK2)
| ~ less_than(sK3,sK2)
| pair_in_list(update_slb(sK0,sK3),sK1,sK2) ),
inference(instantiation,[status(thm)],[c_1651]) ).
cnf(c_1976,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1975,c_737,c_78,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SWV413+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n020.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 : Fri May 3 00:27:16 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/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
% 2.50/1.15 % SZS status Started for theBenchmark.p
% 2.50/1.15 % SZS status Theorem for theBenchmark.p
% 2.50/1.15
% 2.50/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.50/1.15
% 2.50/1.15 ------ iProver source info
% 2.50/1.15
% 2.50/1.15 git: date: 2024-05-02 19:28:25 +0000
% 2.50/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.50/1.15 git: non_committed_changes: false
% 2.50/1.15
% 2.50/1.15 ------ Parsing...
% 2.50/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.50/1.15
% 2.50/1.15 ------ 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_e
% 2.50/1.15
% 2.50/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.50/1.15
% 2.50/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.50/1.15 ------ Proving...
% 2.50/1.15 ------ Problem Properties
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15 clauses 29
% 2.50/1.15 conjectures 4
% 2.50/1.15 EPR 12
% 2.50/1.15 Horn 21
% 2.50/1.15 unary 14
% 2.50/1.15 binary 8
% 2.50/1.15 lits 51
% 2.50/1.15 lits eq 14
% 2.50/1.15 fd_pure 0
% 2.50/1.15 fd_pseudo 0
% 2.50/1.15 fd_cond 0
% 2.50/1.15 fd_pseudo_cond 5
% 2.50/1.15 AC symbols 0
% 2.50/1.15
% 2.50/1.15 ------ Schedule dynamic 5 is on
% 2.50/1.15
% 2.50/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15 ------
% 2.50/1.15 Current options:
% 2.50/1.15 ------
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15 ------ Proving...
% 2.50/1.15
% 2.50/1.15
% 2.50/1.15 % SZS status Theorem for theBenchmark.p
% 2.50/1.15
% 2.50/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.50/1.15
% 2.50/1.15
%------------------------------------------------------------------------------