TSTP Solution File: NUM423+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM423+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:30:22 EDT 2023
% Result : Theorem 2.52s 1.18s
% Output : CNFRefutation 2.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 61 ( 30 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 58 ( 25 ~; 21 |; 10 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn; 8 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntZero) ).
fof(f10,axiom,
! [X0] :
( aInteger0(X0)
=> ( sz00 = sdtpldt0(smndt0(X0),X0)
& sz00 = sdtpldt0(X0,smndt0(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddNeg) ).
fof(f15,axiom,
! [X0] :
( aInteger0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulZero) ).
fof(f20,axiom,
( sz00 != xq
& aInteger0(xq)
& aInteger0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__671) ).
fof(f21,conjecture,
( sdteqdtlpzmzozddtrp0(xa,xa,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
| ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xa))
& aInteger0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f22,negated_conjecture,
~ ( sdteqdtlpzmzozddtrp0(xa,xa,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
| ? [X0] :
( sdtasdt0(xq,X0) = sdtpldt0(xa,smndt0(xa))
& aInteger0(X0) ) ),
inference(negated_conjecture,[],[f21]) ).
fof(f34,plain,
! [X0] :
( ( sz00 = sdtpldt0(smndt0(X0),X0)
& sz00 = sdtpldt0(X0,smndt0(X0)) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f42,plain,
! [X0] :
( ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f49,plain,
( ~ sdteqdtlpzmzozddtrp0(xa,xa,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
& ! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xa))
| ~ aInteger0(X0) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f56,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f65,plain,
! [X0] :
( sz00 = sdtpldt0(X0,smndt0(X0))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f73,plain,
! [X0] :
( sz00 = sdtasdt0(X0,sz00)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f85,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f20]) ).
fof(f86,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f20]) ).
fof(f88,plain,
! [X0] :
( sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xa))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f49]) ).
cnf(c_49,plain,
aInteger0(sz00),
inference(cnf_transformation,[],[f56]) ).
cnf(c_59,plain,
( ~ aInteger0(X0)
| sdtpldt0(X0,smndt0(X0)) = sz00 ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_67,plain,
( ~ aInteger0(X0)
| sdtasdt0(X0,sz00) = sz00 ),
inference(cnf_transformation,[],[f73]) ).
cnf(c_79,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f86]) ).
cnf(c_80,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f85]) ).
cnf(c_83,negated_conjecture,
( sdtpldt0(xa,smndt0(xa)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f88]) ).
cnf(c_96,plain,
( sdtpldt0(xa,smndt0(xa)) != sdtasdt0(xq,sz00)
| ~ aInteger0(sz00) ),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_799,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_1234,plain,
sdtasdt0(xq,sz00) = sz00,
inference(superposition,[status(thm)],[c_79,c_67]) ).
cnf(c_1327,plain,
( sdtpldt0(xa,smndt0(xa)) != X0
| sdtasdt0(xq,X1) != X0
| sdtpldt0(xa,smndt0(xa)) = sdtasdt0(xq,X1) ),
inference(instantiation,[status(thm)],[c_799]) ).
cnf(c_1328,plain,
( sdtpldt0(xa,smndt0(xa)) != sz00
| sdtasdt0(xq,sz00) != sz00
| sdtpldt0(xa,smndt0(xa)) = sdtasdt0(xq,sz00) ),
inference(instantiation,[status(thm)],[c_1327]) ).
cnf(c_1333,plain,
( ~ aInteger0(xa)
| sdtpldt0(xa,smndt0(xa)) = sz00 ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_1334,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1333,c_1328,c_1234,c_96,c_49,c_80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM423+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n027.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 : Fri Aug 25 10:27:18 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.52/1.18 % SZS status Started for theBenchmark.p
% 2.52/1.18 % SZS status Theorem for theBenchmark.p
% 2.52/1.18
% 2.52/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.52/1.18
% 2.52/1.18 ------ iProver source info
% 2.52/1.18
% 2.52/1.18 git: date: 2023-05-31 18:12:56 +0000
% 2.52/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.52/1.18 git: non_committed_changes: false
% 2.52/1.18 git: last_make_outside_of_git: false
% 2.52/1.18
% 2.52/1.18 ------ Parsing...
% 2.52/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.52/1.18
% 2.52/1.18 ------ 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
% 2.52/1.18
% 2.52/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.52/1.18
% 2.52/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.52/1.18 ------ Proving...
% 2.52/1.18 ------ Problem Properties
% 2.52/1.18
% 2.52/1.18
% 2.52/1.18 clauses 28
% 2.52/1.18 conjectures 1
% 2.52/1.18 EPR 5
% 2.52/1.18 Horn 25
% 2.52/1.18 unary 5
% 2.52/1.18 binary 12
% 2.52/1.18 lits 70
% 2.52/1.18 lits eq 24
% 2.52/1.18 fd_pure 0
% 2.52/1.18 fd_pseudo 0
% 2.52/1.18 fd_cond 3
% 2.52/1.18 fd_pseudo_cond 0
% 2.52/1.18 AC symbols 0
% 2.52/1.18
% 2.52/1.18 ------ Schedule dynamic 5 is on
% 2.52/1.18
% 2.52/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.52/1.18
% 2.52/1.18
% 2.52/1.18 ------
% 2.52/1.18 Current options:
% 2.52/1.18 ------
% 2.52/1.18
% 2.52/1.18
% 2.52/1.18
% 2.52/1.18
% 2.52/1.18 ------ Proving...
% 2.52/1.18
% 2.52/1.18
% 2.52/1.18 % SZS status Theorem for theBenchmark.p
% 2.52/1.18
% 2.52/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.52/1.18
% 2.52/1.18
%------------------------------------------------------------------------------