TSTP Solution File: NUM615+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM615+3 : 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 11:31:53 EDT 2023
% Result : Theorem 7.05s 1.54s
% Output : CNFRefutation 7.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 30 ( 14 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 26 ( 10 ~; 6 |; 9 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn; 2 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f106,axiom,
? [X0] :
( sdtlpdtrp0(xe,X0) = xp
& aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5182) ).
fof(f111,conjecture,
? [X0] :
( sdtlpdtrp0(xe,X0) = xp
& ( aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| ( sdtlpdtrp0(xd,X0) = szDzizrdt0(xd)
& aElementOf0(X0,szDzozmdt0(xd)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f112,negated_conjecture,
~ ? [X0] :
( sdtlpdtrp0(xe,X0) = xp
& ( aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| ( sdtlpdtrp0(xd,X0) = szDzizrdt0(xd)
& aElementOf0(X0,szDzozmdt0(xd)) ) ) ),
inference(negated_conjecture,[],[f111]) ).
fof(f272,plain,
! [X0] :
( sdtlpdtrp0(xe,X0) != xp
| ( ~ aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ( sdtlpdtrp0(xd,X0) != szDzizrdt0(xd)
| ~ aElementOf0(X0,szDzozmdt0(xd)) ) ) ),
inference(ennf_transformation,[],[f112]) ).
fof(f501,plain,
( ? [X0] :
( sdtlpdtrp0(xe,X0) = xp
& aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
=> ( xp = sdtlpdtrp0(xe,sK72)
& aElementOf0(sK72,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) ),
introduced(choice_axiom,[]) ).
fof(f502,plain,
( xp = sdtlpdtrp0(xe,sK72)
& aElementOf0(sK72,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK72])],[f106,f501]) ).
fof(f921,plain,
aElementOf0(sK72,sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(cnf_transformation,[],[f502]) ).
fof(f922,plain,
xp = sdtlpdtrp0(xe,sK72),
inference(cnf_transformation,[],[f502]) ).
fof(f930,plain,
! [X0] :
( sdtlpdtrp0(xe,X0) != xp
| ~ aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(cnf_transformation,[],[f272]) ).
cnf(c_467,plain,
sdtlpdtrp0(xe,sK72) = xp,
inference(cnf_transformation,[],[f922]) ).
cnf(c_468,plain,
aElementOf0(sK72,sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(cnf_transformation,[],[f921]) ).
cnf(c_475,negated_conjecture,
( sdtlpdtrp0(xe,X0) != xp
| ~ aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(cnf_transformation,[],[f930]) ).
cnf(c_31540,plain,
~ aElementOf0(sK72,sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(superposition,[status(thm)],[c_467,c_475]) ).
cnf(c_31541,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_31540,c_468]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM615+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri Aug 25 12:41:28 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.16/0.40 Running first-order theorem proving
% 0.16/0.40 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.05/1.54 % SZS status Started for theBenchmark.p
% 7.05/1.54 % SZS status Theorem for theBenchmark.p
% 7.05/1.54
% 7.05/1.54 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.05/1.54
% 7.05/1.54 ------ iProver source info
% 7.05/1.54
% 7.05/1.54 git: date: 2023-05-31 18:12:56 +0000
% 7.05/1.54 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.05/1.54 git: non_committed_changes: false
% 7.05/1.54 git: last_make_outside_of_git: false
% 7.05/1.54
% 7.05/1.54 ------ Parsing...
% 7.05/1.54 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.05/1.54
% 7.05/1.54 ------ Preprocessing... sup_sim: 14 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 7.05/1.54
% 7.05/1.54 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.05/1.54
% 7.05/1.54 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.05/1.54 ------ Proving...
% 7.05/1.54 ------ Problem Properties
% 7.05/1.54
% 7.05/1.54
% 7.05/1.54 clauses 383
% 7.05/1.54 conjectures 1
% 7.05/1.54 EPR 74
% 7.05/1.54 Horn 308
% 7.05/1.54 unary 59
% 7.05/1.54 binary 104
% 7.05/1.54 lits 1188
% 7.05/1.54 lits eq 174
% 7.05/1.54 fd_pure 0
% 7.05/1.54 fd_pseudo 0
% 7.05/1.54 fd_cond 11
% 7.05/1.54 fd_pseudo_cond 39
% 7.05/1.54 AC symbols 0
% 7.05/1.54
% 7.05/1.54 ------ Schedule dynamic 5 is on
% 7.05/1.54
% 7.05/1.54 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.05/1.54
% 7.05/1.54
% 7.05/1.54 ------
% 7.05/1.54 Current options:
% 7.05/1.54 ------
% 7.05/1.54
% 7.05/1.54
% 7.05/1.54
% 7.05/1.54
% 7.05/1.54 ------ Proving...
% 7.05/1.54
% 7.05/1.54
% 7.05/1.54 % SZS status Theorem for theBenchmark.p
% 7.05/1.54
% 7.05/1.54 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.05/1.54
% 7.05/1.54
%------------------------------------------------------------------------------