TSTP Solution File: SWV402+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV402+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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:20 EDT 2024
% Result : Theorem 0.43s 1.12s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 30 ( 11 ~; 0 |; 15 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 4 sgn 15 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
fof(f19,conjecture,
! [X0,X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) )
=> pair_in_list(update_slb(create_slb,X3),X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l38_co) ).
fof(f20,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) )
=> pair_in_list(update_slb(create_slb,X3),X1,X3) ),
inference(negated_conjecture,[],[f19]) ).
fof(f21,plain,
~ ! [X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) )
=> pair_in_list(update_slb(create_slb,X3),X1,X3) ),
inference(rectify,[],[f20]) ).
fof(f30,plain,
? [X1,X2,X3] :
( ~ pair_in_list(update_slb(create_slb,X3),X1,X3)
& strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) ),
inference(ennf_transformation,[],[f21]) ).
fof(f31,plain,
? [X1,X2,X3] :
( ~ pair_in_list(update_slb(create_slb,X3),X1,X3)
& strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) ),
inference(flattening,[],[f30]) ).
fof(f38,plain,
? [X0,X1,X2] :
( ~ pair_in_list(update_slb(create_slb,X2),X0,X2)
& strictly_less_than(X1,X2)
& pair_in_list(create_slb,X0,X1) ),
inference(rectify,[],[f31]) ).
fof(f39,plain,
( ? [X0,X1,X2] :
( ~ pair_in_list(update_slb(create_slb,X2),X0,X2)
& strictly_less_than(X1,X2)
& pair_in_list(create_slb,X0,X1) )
=> ( ~ pair_in_list(update_slb(create_slb,sK2),sK0,sK2)
& strictly_less_than(sK1,sK2)
& pair_in_list(create_slb,sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
( ~ pair_in_list(update_slb(create_slb,sK2),sK0,sK2)
& strictly_less_than(sK1,sK2)
& pair_in_list(create_slb,sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f38,f39]) ).
fof(f54,plain,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[],[f10]) ).
fof(f66,plain,
pair_in_list(create_slb,sK0,sK1),
inference(cnf_transformation,[],[f40]) ).
cnf(c_62,plain,
~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[],[f54]) ).
cnf(c_76,negated_conjecture,
pair_in_list(create_slb,sK0,sK1),
inference(cnf_transformation,[],[f66]) ).
cnf(c_176,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_76,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV402+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n004.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:23:03 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.43/1.12 % SZS status Started for theBenchmark.p
% 0.43/1.12 % SZS status Theorem for theBenchmark.p
% 0.43/1.12
% 0.43/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.43/1.12
% 0.43/1.12 ------ iProver source info
% 0.43/1.12
% 0.43/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.43/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.43/1.12 git: non_committed_changes: false
% 0.43/1.12
% 0.43/1.12 ------ Parsing...
% 0.43/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.43/1.12
% 0.43/1.12 ------ Preprocessing...
% 0.43/1.12
% 0.43/1.12 % SZS status Theorem for theBenchmark.p
% 0.43/1.12
% 0.43/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.12
% 0.43/1.12
%------------------------------------------------------------------------------