TSTP Solution File: COM012+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : COM012+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:03 EDT 2023
% Result : Theorem 1.74s 1.16s
% Output : CNFRefutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 52 ( 18 unt; 0 def)
% Number of atoms : 199 ( 35 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 266 ( 119 ~; 120 |; 19 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 65 ( 0 sgn; 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1,X2,X3] :
( ( aElement0(X3)
& aElement0(X2)
& aRewritingSystem0(X1)
& aElement0(X0) )
=> ( ( sdtmndtplgtdt0(X2,X1,X3)
& sdtmndtplgtdt0(X0,X1,X2) )
=> sdtmndtplgtdt0(X0,X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCTrans) ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( aElement0(X2)
& aRewritingSystem0(X1)
& aElement0(X0) )
=> ( sdtmndtasgtdt0(X0,X1,X2)
<=> ( sdtmndtplgtdt0(X0,X1,X2)
| X0 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCRDef) ).
fof(f9,axiom,
( aElement0(xz)
& aElement0(xy)
& aRewritingSystem0(xR)
& aElement0(xx) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__349) ).
fof(f10,conjecture,
( ( sdtmndtasgtdt0(xy,xR,xz)
& sdtmndtasgtdt0(xx,xR,xy) )
=> sdtmndtasgtdt0(xx,xR,xz) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f11,negated_conjecture,
~ ( ( sdtmndtasgtdt0(xy,xR,xz)
& sdtmndtasgtdt0(xx,xR,xy) )
=> sdtmndtasgtdt0(xx,xR,xz) ),
inference(negated_conjecture,[],[f10]) ).
fof(f20,plain,
! [X0,X1,X2,X3] :
( sdtmndtplgtdt0(X0,X1,X3)
| ~ sdtmndtplgtdt0(X2,X1,X3)
| ~ sdtmndtplgtdt0(X0,X1,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f21,plain,
! [X0,X1,X2,X3] :
( sdtmndtplgtdt0(X0,X1,X3)
| ~ sdtmndtplgtdt0(X2,X1,X3)
| ~ sdtmndtplgtdt0(X0,X1,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( sdtmndtasgtdt0(X0,X1,X2)
<=> ( sdtmndtplgtdt0(X0,X1,X2)
| X0 = X2 ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( sdtmndtasgtdt0(X0,X1,X2)
<=> ( sdtmndtplgtdt0(X0,X1,X2)
| X0 = X2 ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f22]) ).
fof(f24,plain,
( ~ sdtmndtasgtdt0(xx,xR,xz)
& sdtmndtasgtdt0(xy,xR,xz)
& sdtmndtasgtdt0(xx,xR,xy) ),
inference(ennf_transformation,[],[f11]) ).
fof(f25,plain,
( ~ sdtmndtasgtdt0(xx,xR,xz)
& sdtmndtasgtdt0(xy,xR,xz)
& sdtmndtasgtdt0(xx,xR,xy) ),
inference(flattening,[],[f24]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( ( sdtmndtasgtdt0(X0,X1,X2)
| ( ~ sdtmndtplgtdt0(X0,X1,X2)
& X0 != X2 ) )
& ( sdtmndtplgtdt0(X0,X1,X2)
| X0 = X2
| ~ sdtmndtasgtdt0(X0,X1,X2) ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(nnf_transformation,[],[f23]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( ( sdtmndtasgtdt0(X0,X1,X2)
| ( ~ sdtmndtplgtdt0(X0,X1,X2)
& X0 != X2 ) )
& ( sdtmndtplgtdt0(X0,X1,X2)
| X0 = X2
| ~ sdtmndtasgtdt0(X0,X1,X2) ) )
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(flattening,[],[f31]) ).
fof(f39,plain,
! [X2,X3,X0,X1] :
( sdtmndtplgtdt0(X0,X1,X3)
| ~ sdtmndtplgtdt0(X2,X1,X3)
| ~ sdtmndtplgtdt0(X0,X1,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f40,plain,
! [X2,X0,X1] :
( sdtmndtplgtdt0(X0,X1,X2)
| X0 = X2
| ~ sdtmndtasgtdt0(X0,X1,X2)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f42,plain,
! [X2,X0,X1] :
( sdtmndtasgtdt0(X0,X1,X2)
| ~ sdtmndtplgtdt0(X0,X1,X2)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f43,plain,
aElement0(xx),
inference(cnf_transformation,[],[f9]) ).
fof(f44,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f9]) ).
fof(f45,plain,
aElement0(xy),
inference(cnf_transformation,[],[f9]) ).
fof(f46,plain,
aElement0(xz),
inference(cnf_transformation,[],[f9]) ).
fof(f47,plain,
sdtmndtasgtdt0(xx,xR,xy),
inference(cnf_transformation,[],[f25]) ).
fof(f48,plain,
sdtmndtasgtdt0(xy,xR,xz),
inference(cnf_transformation,[],[f25]) ).
fof(f49,plain,
~ sdtmndtasgtdt0(xx,xR,xz),
inference(cnf_transformation,[],[f25]) ).
cnf(c_55,plain,
( ~ sdtmndtplgtdt0(X0,X1,X2)
| ~ sdtmndtplgtdt0(X3,X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aRewritingSystem0(X1)
| sdtmndtplgtdt0(X3,X1,X2) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_56,plain,
( ~ sdtmndtplgtdt0(X0,X1,X2)
| ~ aElement0(X0)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| sdtmndtasgtdt0(X0,X1,X2) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_58,plain,
( ~ sdtmndtasgtdt0(X0,X1,X2)
| ~ aElement0(X0)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| X0 = X2
| sdtmndtplgtdt0(X0,X1,X2) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_59,plain,
aElement0(xz),
inference(cnf_transformation,[],[f46]) ).
cnf(c_60,plain,
aElement0(xy),
inference(cnf_transformation,[],[f45]) ).
cnf(c_61,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f44]) ).
cnf(c_62,plain,
aElement0(xx),
inference(cnf_transformation,[],[f43]) ).
cnf(c_63,negated_conjecture,
~ sdtmndtasgtdt0(xx,xR,xz),
inference(cnf_transformation,[],[f49]) ).
cnf(c_64,negated_conjecture,
sdtmndtasgtdt0(xy,xR,xz),
inference(cnf_transformation,[],[f48]) ).
cnf(c_65,negated_conjecture,
sdtmndtasgtdt0(xx,xR,xy),
inference(cnf_transformation,[],[f47]) ).
cnf(c_311,plain,
( X0 != xx
| X1 != xR
| X2 != xz
| ~ sdtmndtplgtdt0(X0,X1,X2)
| ~ aElement0(X0)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1) ),
inference(resolution_lifted,[status(thm)],[c_56,c_63]) ).
cnf(c_312,plain,
( ~ sdtmndtplgtdt0(xx,xR,xz)
| ~ aElement0(xz)
| ~ aElement0(xx)
| ~ aRewritingSystem0(xR) ),
inference(unflattening,[status(thm)],[c_311]) ).
cnf(c_313,plain,
~ sdtmndtplgtdt0(xx,xR,xz),
inference(global_subsumption_just,[status(thm)],[c_312,c_62,c_61,c_59,c_312]) ).
cnf(c_318,plain,
( X0 != xy
| X1 != xR
| X2 != xz
| ~ aElement0(X0)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| X0 = X2
| sdtmndtplgtdt0(X0,X1,X2) ),
inference(resolution_lifted,[status(thm)],[c_58,c_64]) ).
cnf(c_319,plain,
( ~ aElement0(xz)
| ~ aElement0(xy)
| ~ aRewritingSystem0(xR)
| xy = xz
| sdtmndtplgtdt0(xy,xR,xz) ),
inference(unflattening,[status(thm)],[c_318]) ).
cnf(c_320,plain,
( xy = xz
| sdtmndtplgtdt0(xy,xR,xz) ),
inference(global_subsumption_just,[status(thm)],[c_319,c_61,c_60,c_59,c_319]) ).
cnf(c_328,plain,
( X0 != xx
| X1 != xR
| X2 != xy
| ~ aElement0(X0)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| X0 = X2
| sdtmndtplgtdt0(X0,X1,X2) ),
inference(resolution_lifted,[status(thm)],[c_58,c_65]) ).
cnf(c_329,plain,
( ~ aElement0(xy)
| ~ aElement0(xx)
| ~ aRewritingSystem0(xR)
| xx = xy
| sdtmndtplgtdt0(xx,xR,xy) ),
inference(unflattening,[status(thm)],[c_328]) ).
cnf(c_330,plain,
( xx = xy
| sdtmndtplgtdt0(xx,xR,xy) ),
inference(global_subsumption_just,[status(thm)],[c_329,c_62,c_61,c_60,c_329]) ).
cnf(c_345,plain,
( xz != xz
| xy != xx
| xR != xR ),
inference(resolution_lifted,[status(thm)],[c_63,c_64]) ).
cnf(c_355,plain,
( xz != xy
| xR != xR
| xx != xx ),
inference(resolution_lifted,[status(thm)],[c_63,c_65]) ).
cnf(c_417,plain,
( X0 != xR
| ~ sdtmndtplgtdt0(X1,X0,X2)
| ~ sdtmndtplgtdt0(X3,X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3)
| sdtmndtplgtdt0(X3,X0,X2) ),
inference(resolution_lifted,[status(thm)],[c_55,c_61]) ).
cnf(c_418,plain,
( ~ sdtmndtplgtdt0(X0,xR,X1)
| ~ sdtmndtplgtdt0(X2,xR,X0)
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2)
| sdtmndtplgtdt0(X2,xR,X1) ),
inference(unflattening,[status(thm)],[c_417]) ).
cnf(c_523,plain,
xz != xy,
inference(equality_resolution_simp,[status(thm)],[c_355]) ).
cnf(c_524,plain,
xy != xx,
inference(equality_resolution_simp,[status(thm)],[c_345]) ).
cnf(c_1040,plain,
( ~ sdtmndtplgtdt0(X0,xR,xy)
| ~ aElement0(X0)
| ~ aElement0(xz)
| ~ aElement0(xy)
| xz = xy
| sdtmndtplgtdt0(X0,xR,xz) ),
inference(superposition,[status(thm)],[c_320,c_418]) ).
cnf(c_1048,plain,
( ~ sdtmndtplgtdt0(X0,xR,xy)
| ~ aElement0(X0)
| sdtmndtplgtdt0(X0,xR,xz) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1040,c_523,c_60,c_59]) ).
cnf(c_1091,plain,
( ~ aElement0(xx)
| xy = xx
| sdtmndtplgtdt0(xx,xR,xz) ),
inference(superposition,[status(thm)],[c_330,c_1048]) ).
cnf(c_1093,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1091,c_313,c_524,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM012+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 13:24:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.74/1.16 % SZS status Started for theBenchmark.p
% 1.74/1.16 % SZS status Theorem for theBenchmark.p
% 1.74/1.16
% 1.74/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.74/1.16
% 1.74/1.16 ------ iProver source info
% 1.74/1.16
% 1.74/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.74/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.74/1.16 git: non_committed_changes: false
% 1.74/1.16 git: last_make_outside_of_git: false
% 1.74/1.16
% 1.74/1.16 ------ Parsing...
% 1.74/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.74/1.16
% 1.74/1.16 ------ 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
% 1.74/1.16
% 1.74/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.74/1.16
% 1.74/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.74/1.16 ------ Proving...
% 1.74/1.16 ------ Problem Properties
% 1.74/1.16
% 1.74/1.16
% 1.74/1.16 clauses 16
% 1.74/1.16 conjectures 0
% 1.74/1.16 EPR 13
% 1.74/1.16 Horn 11
% 1.74/1.16 unary 7
% 1.74/1.16 binary 2
% 1.74/1.16 lits 43
% 1.74/1.16 lits eq 5
% 1.74/1.16 fd_pure 0
% 1.74/1.16 fd_pseudo 0
% 1.74/1.16 fd_cond 0
% 1.74/1.16 fd_pseudo_cond 0
% 1.74/1.16 AC symbols 0
% 1.74/1.16
% 1.74/1.16 ------ Schedule dynamic 5 is on
% 1.74/1.16
% 1.74/1.16 ------ no conjectures: strip conj schedule
% 1.74/1.16
% 1.74/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.74/1.16
% 1.74/1.16
% 1.74/1.16 ------
% 1.74/1.16 Current options:
% 1.74/1.16 ------
% 1.74/1.16
% 1.74/1.16
% 1.74/1.16
% 1.74/1.16
% 1.74/1.16 ------ Proving...
% 1.74/1.16
% 1.74/1.16
% 1.74/1.16 % SZS status Theorem for theBenchmark.p
% 1.74/1.16
% 1.74/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.74/1.16
% 1.74/1.16
%------------------------------------------------------------------------------