TSTP Solution File: SWV405+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV405+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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 : Thu Aug 31 22:32:53 EDT 2023
% Result : Theorem 0.94s 1.16s
% Output : CNFRefutation 0.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 68 ( 27 ~; 22 |; 12 &)
% ( 2 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 56 ( 6 sgn; 30 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax22) ).
fof(f24,axiom,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax36) ).
fof(f42,conjecture,
! [X0,X1] :
( check_cpq(triple(X0,create_slb,X1))
<=> ! [X2,X3] :
( pair_in_list(create_slb,X2,X3)
=> less_than(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l41_co) ).
fof(f43,negated_conjecture,
~ ! [X0,X1] :
( check_cpq(triple(X0,create_slb,X1))
<=> ! [X2,X3] :
( pair_in_list(create_slb,X2,X3)
=> less_than(X3,X2) ) ),
inference(negated_conjecture,[],[f42]) ).
fof(f82,plain,
? [X0,X1] :
( check_cpq(triple(X0,create_slb,X1))
<~> ! [X2,X3] :
( less_than(X3,X2)
| ~ pair_in_list(create_slb,X2,X3) ) ),
inference(ennf_transformation,[],[f43]) ).
fof(f89,plain,
? [X0,X1] :
( ( ? [X2,X3] :
( ~ less_than(X3,X2)
& pair_in_list(create_slb,X2,X3) )
| ~ check_cpq(triple(X0,create_slb,X1)) )
& ( ! [X2,X3] :
( less_than(X3,X2)
| ~ pair_in_list(create_slb,X2,X3) )
| check_cpq(triple(X0,create_slb,X1)) ) ),
inference(nnf_transformation,[],[f82]) ).
fof(f90,plain,
? [X0,X1] :
( ( ? [X2,X3] :
( ~ less_than(X3,X2)
& pair_in_list(create_slb,X2,X3) )
| ~ check_cpq(triple(X0,create_slb,X1)) )
& ( ! [X4,X5] :
( less_than(X5,X4)
| ~ pair_in_list(create_slb,X4,X5) )
| check_cpq(triple(X0,create_slb,X1)) ) ),
inference(rectify,[],[f89]) ).
fof(f91,plain,
( ? [X0,X1] :
( ( ? [X2,X3] :
( ~ less_than(X3,X2)
& pair_in_list(create_slb,X2,X3) )
| ~ check_cpq(triple(X0,create_slb,X1)) )
& ( ! [X4,X5] :
( less_than(X5,X4)
| ~ pair_in_list(create_slb,X4,X5) )
| check_cpq(triple(X0,create_slb,X1)) ) )
=> ( ( ? [X2,X3] :
( ~ less_than(X3,X2)
& pair_in_list(create_slb,X2,X3) )
| ~ check_cpq(triple(sK0,create_slb,sK1)) )
& ( ! [X4,X5] :
( less_than(X5,X4)
| ~ pair_in_list(create_slb,X4,X5) )
| check_cpq(triple(sK0,create_slb,sK1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f92,plain,
( ? [X2,X3] :
( ~ less_than(X3,X2)
& pair_in_list(create_slb,X2,X3) )
=> ( ~ less_than(sK3,sK2)
& pair_in_list(create_slb,sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
( ( ( ~ less_than(sK3,sK2)
& pair_in_list(create_slb,sK2,sK3) )
| ~ check_cpq(triple(sK0,create_slb,sK1)) )
& ( ! [X4,X5] :
( less_than(X5,X4)
| ~ pair_in_list(create_slb,X4,X5) )
| check_cpq(triple(sK0,create_slb,sK1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f90,f92,f91]) ).
fof(f105,plain,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[],[f10]) ).
fof(f122,plain,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f24]) ).
fof(f142,plain,
! [X4,X5] :
( less_than(X5,X4)
| ~ pair_in_list(create_slb,X4,X5)
| check_cpq(triple(sK0,create_slb,sK1)) ),
inference(cnf_transformation,[],[f93]) ).
fof(f143,plain,
( pair_in_list(create_slb,sK2,sK3)
| ~ check_cpq(triple(sK0,create_slb,sK1)) ),
inference(cnf_transformation,[],[f93]) ).
cnf(c_60,plain,
~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[],[f105]) ).
cnf(c_77,plain,
check_cpq(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f122]) ).
cnf(c_96,negated_conjecture,
( ~ check_cpq(triple(sK0,create_slb,sK1))
| pair_in_list(create_slb,sK2,sK3) ),
inference(cnf_transformation,[],[f143]) ).
cnf(c_97,negated_conjecture,
( ~ pair_in_list(create_slb,X0,X1)
| check_cpq(triple(sK0,create_slb,sK1))
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f142]) ).
cnf(c_133,negated_conjecture,
~ pair_in_list(create_slb,X0,X1),
inference(global_subsumption_just,[status(thm)],[c_97,c_60]) ).
cnf(c_151,plain,
pair_in_list(create_slb,sK2,sK3),
inference(backward_subsumption_resolution,[status(thm)],[c_96,c_77]) ).
cnf(c_155,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_151,c_133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV405+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 07:17:35 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.94/1.16 % SZS status Started for theBenchmark.p
% 0.94/1.16 % SZS status Theorem for theBenchmark.p
% 0.94/1.16
% 0.94/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.94/1.16
% 0.94/1.16 ------ iProver source info
% 0.94/1.16
% 0.94/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.94/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.94/1.16 git: non_committed_changes: false
% 0.94/1.16 git: last_make_outside_of_git: false
% 0.94/1.16
% 0.94/1.16 ------ Parsing...
% 0.94/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.94/1.16
% 0.94/1.16 ------ Preprocessing...
% 0.94/1.16
% 0.94/1.16 % SZS status Theorem for theBenchmark.p
% 0.94/1.16
% 0.94/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.94/1.16
% 0.94/1.16
%------------------------------------------------------------------------------