TSTP Solution File: LCL666+1.001 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL666+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 07:47:52 EDT 2023
% Result : Theorem 0.45s 0.97s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 81 ( 42 ~; 22 |; 16 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 19 ( 0 sgn; 11 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
fof(f2,conjecture,
~ ? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ~ ( p101(X1)
& p201(X1) )
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ~ ( p101(X1)
& p201(X1) )
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f2]) ).
fof(f4,plain,
? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ~ ( p101(X1)
& p201(X1) )
| ~ r1(X0,X1) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
? [X0] :
( p101(X0)
& p201(X0)
& ! [X1] :
( ~ p101(X1)
| ~ p201(X1)
| ~ r1(X0,X1) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f6,plain,
? [X0] :
( p101(X0)
& p201(X0)
& ! [X1] :
( ~ p101(X1)
| ~ p201(X1)
| ~ r1(X0,X1) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
( ? [X0] :
( p101(X0)
& p201(X0)
& ! [X1] :
( ~ p101(X1)
| ~ p201(X1)
| ~ r1(X0,X1) ) )
=> ( p101(sK0)
& p201(sK0)
& ! [X1] :
( ~ p101(X1)
| ~ p201(X1)
| ~ r1(sK0,X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( p101(sK0)
& p201(sK0)
& ! [X1] :
( ~ p101(X1)
| ~ p201(X1)
| ~ r1(sK0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f9,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f10,plain,
! [X1] :
( ~ p101(X1)
| ~ p201(X1)
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
p201(sK0),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
p101(sK0),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,plain,
r1(X0,X0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_50,negated_conjecture,
p101(sK0),
inference(cnf_transformation,[],[f12]) ).
cnf(c_51,negated_conjecture,
p201(sK0),
inference(cnf_transformation,[],[f11]) ).
cnf(c_52,negated_conjecture,
( ~ r1(sK0,X0)
| ~ p101(X0)
| ~ p201(X0) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_53,plain,
r1(sK0,sK0),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_54,plain,
( ~ r1(sK0,sK0)
| ~ p101(sK0)
| ~ p201(sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_55,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_54,c_53,c_50,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : LCL666+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.09 % Command : run_iprover %s %d THM
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Fri Aug 25 07:10:27 EDT 2023
% 0.08/0.28 % CPUTime :
% 0.12/0.35 Running first-order theorem proving
% 0.12/0.35 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.45/0.97 % SZS status Started for theBenchmark.p
% 0.45/0.97 % SZS status Theorem for theBenchmark.p
% 0.45/0.97
% 0.45/0.97 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.45/0.97
% 0.45/0.97 ------ iProver source info
% 0.45/0.97
% 0.45/0.97 git: date: 2023-05-31 18:12:56 +0000
% 0.45/0.97 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.45/0.97 git: non_committed_changes: false
% 0.45/0.97 git: last_make_outside_of_git: false
% 0.45/0.97
% 0.45/0.97 ------ Parsing...
% 0.45/0.97 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.45/0.97
% 0.45/0.97
% 0.45/0.97 ------ Preprocessing...
% 0.45/0.97
% 0.45/0.97 % SZS status Theorem for theBenchmark.p
% 0.45/0.97
% 0.45/0.97 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/0.97
% 0.45/0.97
%------------------------------------------------------------------------------