TSTP Solution File: SWV384+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV384+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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:18 EDT 2024
% Result : Theorem 3.83s 1.18s
% Output : CNFRefutation 3.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 56 ( 8 unt; 0 def)
% Number of atoms : 249 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 340 ( 147 ~; 137 |; 43 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-3 aty)
% Number of variables : 201 ( 0 sgn 99 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
( ! [X0,X1,X2,X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ( ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5)) )
=> ( ~ ok(im_succ_cpq(triple(X3,X4,X5)))
| ~ check_cpq(im_succ_cpq(triple(X3,X4,X5))) ) ) )
=> ! [X6,X7,X8] :
( ( ~ ok(triple(X6,X7,X8))
| ~ check_cpq(triple(X6,X7,X8)) )
=> ! [X9,X10,X11] :
( succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11))
=> ( ~ check_cpq(triple(X9,X10,X11))
| ~ ok(triple(X9,X10,X11)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l20_induction) ).
fof(f43,axiom,
! [X0,X1,X2] :
( ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) )
=> ( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ~ check_cpq(im_succ_cpq(triple(X0,X1,X2))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_l13) ).
fof(f44,conjecture,
! [X0,X1,X2] :
( ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) )
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l20_co) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) )
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
inference(negated_conjecture,[],[f44]) ).
fof(f84,plain,
( ! [X6,X7,X8] :
( ! [X9,X10,X11] :
( ~ check_cpq(triple(X9,X10,X11))
| ~ ok(triple(X9,X10,X11))
| ~ succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11)) )
| ( ok(triple(X6,X7,X8))
& check_cpq(triple(X6,X7,X8)) ) )
| ? [X0,X1,X2,X3,X4,X5] :
( ok(im_succ_cpq(triple(X3,X4,X5)))
& check_cpq(im_succ_cpq(triple(X3,X4,X5)))
& ( ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5)) )
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f85,plain,
( ! [X6,X7,X8] :
( ! [X9,X10,X11] :
( ~ check_cpq(triple(X9,X10,X11))
| ~ ok(triple(X9,X10,X11))
| ~ succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11)) )
| ( ok(triple(X6,X7,X8))
& check_cpq(triple(X6,X7,X8)) ) )
| ? [X0,X1,X2,X3,X4,X5] :
( ok(im_succ_cpq(triple(X3,X4,X5)))
& check_cpq(im_succ_cpq(triple(X3,X4,X5)))
& ( ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5)) )
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) ) ),
inference(flattening,[],[f84]) ).
fof(f86,plain,
! [X0,X1,X2] :
( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
| ( ok(triple(X0,X1,X2))
& check_cpq(triple(X0,X1,X2)) ) ),
inference(ennf_transformation,[],[f43]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
| ( ok(triple(X0,X1,X2))
& check_cpq(triple(X0,X1,X2)) ) ),
inference(flattening,[],[f86]) ).
fof(f88,plain,
? [X0,X1,X2] :
( ? [X3,X4,X5] :
( check_cpq(triple(X3,X4,X5))
& ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
& ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(ennf_transformation,[],[f45]) ).
fof(f89,plain,
? [X0,X1,X2] :
( ? [X3,X4,X5] :
( check_cpq(triple(X3,X4,X5))
& ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
& ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(flattening,[],[f88]) ).
fof(f96,plain,
( ! [X0,X1,X2] :
( ! [X3,X4,X5] :
( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
| ( ok(triple(X0,X1,X2))
& check_cpq(triple(X0,X1,X2)) ) )
| ? [X6,X7,X8,X9,X10,X11] :
( ok(im_succ_cpq(triple(X9,X10,X11)))
& check_cpq(im_succ_cpq(triple(X9,X10,X11)))
& ( ~ ok(triple(X9,X10,X11))
| ~ check_cpq(triple(X9,X10,X11)) )
& succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11)) ) ),
inference(rectify,[],[f85]) ).
fof(f97,plain,
( ? [X6,X7,X8,X9,X10,X11] :
( ok(im_succ_cpq(triple(X9,X10,X11)))
& check_cpq(im_succ_cpq(triple(X9,X10,X11)))
& ( ~ ok(triple(X9,X10,X11))
| ~ check_cpq(triple(X9,X10,X11)) )
& succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11)) )
=> ( ok(im_succ_cpq(triple(sK3,sK4,sK5)))
& check_cpq(im_succ_cpq(triple(sK3,sK4,sK5)))
& ( ~ ok(triple(sK3,sK4,sK5))
| ~ check_cpq(triple(sK3,sK4,sK5)) )
& succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5)) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
( ! [X0,X1,X2] :
( ! [X3,X4,X5] :
( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
| ( ok(triple(X0,X1,X2))
& check_cpq(triple(X0,X1,X2)) ) )
| ( ok(im_succ_cpq(triple(sK3,sK4,sK5)))
& check_cpq(im_succ_cpq(triple(sK3,sK4,sK5)))
& ( ~ ok(triple(sK3,sK4,sK5))
| ~ check_cpq(triple(sK3,sK4,sK5)) )
& succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f96,f97]) ).
fof(f99,plain,
( ? [X0,X1,X2] :
( ? [X3,X4,X5] :
( check_cpq(triple(X3,X4,X5))
& ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
& ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) ) )
=> ( ? [X5,X4,X3] :
( check_cpq(triple(X3,X4,X5))
& ok(triple(X3,X4,X5))
& succ_cpq(triple(sK6,sK7,sK8),triple(X3,X4,X5)) )
& ( ~ ok(triple(sK6,sK7,sK8))
| ~ check_cpq(triple(sK6,sK7,sK8)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
( ? [X5,X4,X3] :
( check_cpq(triple(X3,X4,X5))
& ok(triple(X3,X4,X5))
& succ_cpq(triple(sK6,sK7,sK8),triple(X3,X4,X5)) )
=> ( check_cpq(triple(sK9,sK10,sK11))
& ok(triple(sK9,sK10,sK11))
& succ_cpq(triple(sK6,sK7,sK8),triple(sK9,sK10,sK11)) ) ),
introduced(choice_axiom,[]) ).
fof(f101,plain,
( check_cpq(triple(sK9,sK10,sK11))
& ok(triple(sK9,sK10,sK11))
& succ_cpq(triple(sK6,sK7,sK8),triple(sK9,sK10,sK11))
& ( ~ ok(triple(sK6,sK7,sK8))
| ~ check_cpq(triple(sK6,sK7,sK8)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11])],[f89,f100,f99]) ).
fof(f151,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| check_cpq(triple(X0,X1,X2))
| ~ ok(triple(sK3,sK4,sK5))
| ~ check_cpq(triple(sK3,sK4,sK5)) ),
inference(cnf_transformation,[],[f98]) ).
fof(f152,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| check_cpq(triple(X0,X1,X2))
| check_cpq(im_succ_cpq(triple(sK3,sK4,sK5))) ),
inference(cnf_transformation,[],[f98]) ).
fof(f153,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| check_cpq(triple(X0,X1,X2))
| ok(im_succ_cpq(triple(sK3,sK4,sK5))) ),
inference(cnf_transformation,[],[f98]) ).
fof(f155,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ok(triple(X0,X1,X2))
| ~ ok(triple(sK3,sK4,sK5))
| ~ check_cpq(triple(sK3,sK4,sK5)) ),
inference(cnf_transformation,[],[f98]) ).
fof(f156,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ok(triple(X0,X1,X2))
| check_cpq(im_succ_cpq(triple(sK3,sK4,sK5))) ),
inference(cnf_transformation,[],[f98]) ).
fof(f157,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ok(triple(X0,X1,X2))
| ok(im_succ_cpq(triple(sK3,sK4,sK5))) ),
inference(cnf_transformation,[],[f98]) ).
fof(f158,plain,
! [X2,X0,X1] :
( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f87]) ).
fof(f159,plain,
! [X2,X0,X1] :
( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f87]) ).
fof(f160,plain,
( ~ ok(triple(sK6,sK7,sK8))
| ~ check_cpq(triple(sK6,sK7,sK8)) ),
inference(cnf_transformation,[],[f101]) ).
fof(f161,plain,
succ_cpq(triple(sK6,sK7,sK8),triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f101]) ).
fof(f162,plain,
ok(triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f101]) ).
fof(f163,plain,
check_cpq(triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f101]) ).
cnf(c_95,plain,
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f157]) ).
cnf(c_96,plain,
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| check_cpq(im_succ_cpq(triple(sK3,sK4,sK5)))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f156]) ).
cnf(c_97,plain,
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(sK3,sK4,sK5))
| ~ ok(triple(sK3,sK4,sK5))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f155]) ).
cnf(c_99,plain,
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f153]) ).
cnf(c_100,plain,
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| check_cpq(im_succ_cpq(triple(sK3,sK4,sK5)))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f152]) ).
cnf(c_101,plain,
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(sK3,sK4,sK5))
| ~ ok(triple(sK3,sK4,sK5))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f151]) ).
cnf(c_103,plain,
( ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
| ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f159]) ).
cnf(c_104,plain,
( ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
| ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f158]) ).
cnf(c_105,negated_conjecture,
check_cpq(triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f163]) ).
cnf(c_106,negated_conjecture,
ok(triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f162]) ).
cnf(c_107,negated_conjecture,
succ_cpq(triple(sK6,sK7,sK8),triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f161]) ).
cnf(c_108,negated_conjecture,
( ~ check_cpq(triple(sK6,sK7,sK8))
| ~ ok(triple(sK6,sK7,sK8)) ),
inference(cnf_transformation,[],[f160]) ).
cnf(c_1314,plain,
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| check_cpq(triple(X0,X1,X2))
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_101]) ).
cnf(c_1315,plain,
( ~ check_cpq(triple(sK3,sK4,sK5))
| ~ ok(triple(sK3,sK4,sK5))
| sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_101]) ).
cnf(c_1316,plain,
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X3,X4,X5))
| ~ sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_def])],[c_97]) ).
cnf(c_1317,plain,
( ~ check_cpq(triple(sK3,sK4,sK5))
| ~ ok(triple(sK3,sK4,sK5))
| sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_97]) ).
cnf(c_2506,plain,
( ~ check_cpq(triple(sK9,sK10,sK11))
| ~ ok(triple(sK9,sK10,sK11))
| ~ sP1_iProver_def
| ok(triple(sK6,sK7,sK8)) ),
inference(superposition,[status(thm)],[c_107,c_1316]) ).
cnf(c_2522,plain,
( ~ check_cpq(triple(sK9,sK10,sK11))
| ~ ok(triple(sK9,sK10,sK11))
| ~ sP0_iProver_def
| check_cpq(triple(sK6,sK7,sK8)) ),
inference(superposition,[status(thm)],[c_107,c_1314]) ).
cnf(c_2552,plain,
( ~ check_cpq(triple(sK9,sK10,sK11))
| ~ ok(triple(sK9,sK10,sK11))
| check_cpq(im_succ_cpq(triple(sK3,sK4,sK5)))
| check_cpq(triple(sK6,sK7,sK8)) ),
inference(superposition,[status(thm)],[c_107,c_100]) ).
cnf(c_2567,plain,
( ~ check_cpq(triple(sK9,sK10,sK11))
| ~ ok(triple(sK9,sK10,sK11))
| ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| check_cpq(triple(sK6,sK7,sK8)) ),
inference(superposition,[status(thm)],[c_107,c_99]) ).
cnf(c_2619,plain,
( ~ check_cpq(triple(sK9,sK10,sK11))
| ~ ok(triple(sK9,sK10,sK11))
| check_cpq(im_succ_cpq(triple(sK3,sK4,sK5)))
| ok(triple(sK6,sK7,sK8)) ),
inference(superposition,[status(thm)],[c_107,c_96]) ).
cnf(c_2639,plain,
( ~ check_cpq(triple(sK9,sK10,sK11))
| ~ ok(triple(sK9,sK10,sK11))
| ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| ok(triple(sK6,sK7,sK8)) ),
inference(superposition,[status(thm)],[c_107,c_95]) ).
cnf(c_2674,plain,
( ~ ok(triple(sK3,sK4,sK5))
| ~ check_cpq(triple(sK3,sK4,sK5)) ),
inference(global_subsumption_just,[status(thm)],[c_1317,c_106,c_105,c_108,c_1315,c_1317,c_2506,c_2522]) ).
cnf(c_2675,plain,
( ~ check_cpq(triple(sK3,sK4,sK5))
| ~ ok(triple(sK3,sK4,sK5)) ),
inference(renaming,[status(thm)],[c_2674]) ).
cnf(c_3208,plain,
check_cpq(im_succ_cpq(triple(sK3,sK4,sK5))),
inference(global_subsumption_just,[status(thm)],[c_100,c_106,c_105,c_108,c_2552,c_2619]) ).
cnf(c_3210,plain,
( ~ ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| ok(triple(sK3,sK4,sK5)) ),
inference(superposition,[status(thm)],[c_3208,c_103]) ).
cnf(c_3211,plain,
( ~ ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| check_cpq(triple(sK3,sK4,sK5)) ),
inference(superposition,[status(thm)],[c_3208,c_104]) ).
cnf(c_3214,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3210,c_3211,c_2675,c_2639,c_2567,c_108,c_105,c_106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SWV384+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu May 2 23:59:10 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.23/0.50 Running first-order theorem proving
% 0.23/0.50 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
% 3.83/1.18 % SZS status Started for theBenchmark.p
% 3.83/1.18 % SZS status Theorem for theBenchmark.p
% 3.83/1.18
% 3.83/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.83/1.18
% 3.83/1.18 ------ iProver source info
% 3.83/1.18
% 3.83/1.18 git: date: 2024-05-02 19:28:25 +0000
% 3.83/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.83/1.18 git: non_committed_changes: false
% 3.83/1.18
% 3.83/1.18 ------ Parsing...
% 3.83/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.83/1.18
% 3.83/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 3.83/1.18
% 3.83/1.18 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.83/1.18
% 3.83/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.83/1.18 ------ Proving...
% 3.83/1.18 ------ Problem Properties
% 3.83/1.18
% 3.83/1.18
% 3.83/1.18 clauses 60
% 3.83/1.18 conjectures 4
% 3.83/1.18 EPR 7
% 3.83/1.18 Horn 40
% 3.83/1.18 unary 19
% 3.83/1.18 binary 17
% 3.83/1.18 lits 142
% 3.83/1.18 lits eq 28
% 3.83/1.18 fd_pure 0
% 3.83/1.18 fd_pseudo 0
% 3.83/1.18 fd_cond 5
% 3.83/1.18 fd_pseudo_cond 5
% 3.83/1.18 AC symbols 0
% 3.83/1.18
% 3.83/1.18 ------ Input Options Time Limit: Unbounded
% 3.83/1.18
% 3.83/1.18
% 3.83/1.18 ------
% 3.83/1.18 Current options:
% 3.83/1.18 ------
% 3.83/1.18
% 3.83/1.18
% 3.83/1.18
% 3.83/1.18
% 3.83/1.18 ------ Proving...
% 3.83/1.18
% 3.83/1.18
% 3.83/1.18 ------ Proving...
% 3.83/1.18
% 3.83/1.18
% 3.83/1.18 ------ Proving...
% 3.83/1.18
% 3.83/1.18
% 3.83/1.18 ------ Proving...
% 3.83/1.18
% 3.83/1.18
% 3.83/1.18 ------ Proving...
% 3.83/1.18
% 3.83/1.18
% 3.83/1.18 % SZS status Theorem for theBenchmark.p
% 3.83/1.18
% 3.83/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.83/1.18
% 3.83/1.18
%------------------------------------------------------------------------------