TSTP Solution File: LCL684+1.001 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL684+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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 02:39:44 EDT 2024
% Result : Theorem 0.64s 1.12s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 114 ( 60 ~; 35 |; 18 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 32 ( 0 sgn 22 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ! [X0] :
( ~ ( p101(X0)
& p201(X0) )
| ~ r1(X1,X0) )
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ! [X0] :
( ~ ( p101(X0)
& p201(X0) )
| ~ r1(X1,X0) )
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ! [X2] :
( ~ ( p101(X2)
& p201(X2) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ! [X2] :
( ~ ( p101(X2)
& p201(X2) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ) ),
inference(flattening,[],[f5]) ).
fof(f9,plain,
? [X0] :
( p101(X0)
& p201(X0)
& ! [X1] :
( ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f10,plain,
? [X0] :
( p101(X0)
& p201(X0)
& ! [X1] :
( ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
( ? [X0] :
( p101(X0)
& p201(X0)
& ! [X1] :
( ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ) )
=> ( p101(sK0)
& p201(sK0)
& ! [X1] :
( ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X1,X2) )
| ~ r1(sK0,X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( p101(sK0)
& p201(sK0)
& ! [X1] :
( ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X1,X2) )
| ~ r1(sK0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f11]) ).
fof(f13,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f15,plain,
! [X2,X1] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X1,X2)
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f16,plain,
p201(sK0),
inference(cnf_transformation,[],[f12]) ).
fof(f17,plain,
p101(sK0),
inference(cnf_transformation,[],[f12]) ).
cnf(c_49,plain,
r1(X0,X0),
inference(cnf_transformation,[],[f13]) ).
cnf(c_51,negated_conjecture,
p101(sK0),
inference(cnf_transformation,[],[f17]) ).
cnf(c_52,negated_conjecture,
p201(sK0),
inference(cnf_transformation,[],[f16]) ).
cnf(c_53,negated_conjecture,
( ~ r1(X0,X1)
| ~ r1(sK0,X0)
| ~ p101(X1)
| ~ p201(X1) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_54,plain,
r1(sK0,sK0),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_55,plain,
( ~ r1(sK0,sK0)
| ~ p101(sK0)
| ~ p201(sK0) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_56,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_55,c_54,c_51,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL684+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n021.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 19:02:58 EDT 2024
% 0.10/0.31 % 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.64/1.12 % SZS status Started for theBenchmark.p
% 0.64/1.12 % SZS status Theorem for theBenchmark.p
% 0.64/1.12
% 0.64/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.64/1.12
% 0.64/1.12 ------ iProver source info
% 0.64/1.12
% 0.64/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.64/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.64/1.12 git: non_committed_changes: false
% 0.64/1.12
% 0.64/1.12 ------ Parsing...
% 0.64/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.64/1.12
% 0.64/1.12
% 0.64/1.12 ------ Preprocessing...
% 0.64/1.12
% 0.64/1.12 % SZS status Theorem for theBenchmark.p
% 0.64/1.12
% 0.64/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.64/1.12
% 0.64/1.12
%------------------------------------------------------------------------------