TSTP Solution File: COM018+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : COM018+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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 : Wed Aug 30 18:42:06 EDT 2023
% Result : Theorem 0.46s 1.16s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 53 ( 3 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 57 ( 28 ~; 22 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 2 sgn; 14 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0] :
( ( isTerminating0(X0)
& aRewritingSystem0(X0) )
=> ! [X1] :
( aElement0(X1)
=> ? [X2] : aNormalFormOfIn0(X2,X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTermNF) ).
fof(f15,axiom,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
fof(f16,axiom,
( isTerminating0(xR)
& isLocallyConfluent0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656_01) ).
fof(f22,axiom,
( sdtmndtasgtdt0(xv,xR,xw)
& sdtmndtasgtdt0(xu,xR,xw)
& aElement0(xw) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__799) ).
fof(f23,conjecture,
? [X0] : aNormalFormOfIn0(X0,xw,xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f24,negated_conjecture,
~ ? [X0] : aNormalFormOfIn0(X0,xw,xR),
inference(negated_conjecture,[],[f23]) ).
fof(f47,plain,
! [X0] :
( ! [X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,X0)
| ~ aElement0(X1) )
| ~ isTerminating0(X0)
| ~ aRewritingSystem0(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f48,plain,
! [X0] :
( ! [X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,X0)
| ~ aElement0(X1) )
| ~ isTerminating0(X0)
| ~ aRewritingSystem0(X0) ),
inference(flattening,[],[f47]) ).
fof(f51,plain,
! [X0] : ~ aNormalFormOfIn0(X0,xw,xR),
inference(ennf_transformation,[],[f24]) ).
fof(f86,plain,
! [X0,X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,X0)
=> aNormalFormOfIn0(sK16(X0,X1),X1,X0) ),
introduced(choice_axiom,[]) ).
fof(f87,plain,
! [X0] :
( ! [X1] :
( aNormalFormOfIn0(sK16(X0,X1),X1,X0)
| ~ aElement0(X1) )
| ~ isTerminating0(X0)
| ~ aRewritingSystem0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK16])],[f48,f86]) ).
fof(f134,plain,
! [X0,X1] :
( aNormalFormOfIn0(sK16(X0,X1),X1,X0)
| ~ aElement0(X1)
| ~ isTerminating0(X0)
| ~ aRewritingSystem0(X0) ),
inference(cnf_transformation,[],[f87]) ).
fof(f135,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f15]) ).
fof(f137,plain,
isTerminating0(xR),
inference(cnf_transformation,[],[f16]) ).
fof(f152,plain,
aElement0(xw),
inference(cnf_transformation,[],[f22]) ).
fof(f155,plain,
! [X0] : ~ aNormalFormOfIn0(X0,xw,xR),
inference(cnf_transformation,[],[f51]) ).
cnf(c_93,plain,
( ~ aElement0(X0)
| ~ aRewritingSystem0(X1)
| ~ isTerminating0(X1)
| aNormalFormOfIn0(sK16(X1,X0),X0,X1) ),
inference(cnf_transformation,[],[f134]) ).
cnf(c_94,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f135]) ).
cnf(c_95,plain,
isTerminating0(xR),
inference(cnf_transformation,[],[f137]) ).
cnf(c_113,plain,
aElement0(xw),
inference(cnf_transformation,[],[f152]) ).
cnf(c_114,negated_conjecture,
~ aNormalFormOfIn0(X0,xw,xR),
inference(cnf_transformation,[],[f155]) ).
cnf(c_1272,plain,
( sK16(X0,X1) != X2
| X0 != xR
| X1 != xw
| ~ aElement0(X1)
| ~ aRewritingSystem0(X0)
| ~ isTerminating0(X0) ),
inference(resolution_lifted,[status(thm)],[c_93,c_114]) ).
cnf(c_1273,plain,
( ~ aElement0(xw)
| ~ aRewritingSystem0(xR)
| ~ isTerminating0(xR) ),
inference(unflattening,[status(thm)],[c_1272]) ).
cnf(c_1274,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1273,c_94,c_95,c_113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : COM018+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n003.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 13:06:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.46/1.16 % SZS status Started for theBenchmark.p
% 0.46/1.16 % SZS status Theorem for theBenchmark.p
% 0.46/1.16
% 0.46/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.46/1.16
% 0.46/1.16 ------ iProver source info
% 0.46/1.16
% 0.46/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.46/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.46/1.16 git: non_committed_changes: false
% 0.46/1.16 git: last_make_outside_of_git: false
% 0.46/1.16
% 0.46/1.16 ------ Parsing...
% 0.46/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.16
% 0.46/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s
% 0.46/1.16
% 0.46/1.16 % SZS status Theorem for theBenchmark.p
% 0.46/1.16
% 0.46/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.16
% 0.46/1.16
%------------------------------------------------------------------------------