TSTP Solution File: NUM436+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM436+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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:27 EDT 2023
% Result : Theorem 3.26s 1.16s
% Output : CNFRefutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 13 unt; 0 def)
% Number of atoms : 113 ( 27 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 134 ( 59 ~; 45 |; 29 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn; 16 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntMult) ).
fof(f23,axiom,
( sz00 != xq
& aInteger0(xq)
& sz00 != xp
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__979) ).
fof(f25,axiom,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),xm)
& aInteger0(xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1032) ).
fof(f26,axiom,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm))
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,xm)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1071) ).
fof(f27,conjecture,
( ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X0)
& aInteger0(X0) ) )
& ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,X0)
& aInteger0(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f28,negated_conjecture,
~ ( ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X0)
& aInteger0(X0) ) )
& ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,X0)
& aInteger0(X0) ) ) ),
inference(negated_conjecture,[],[f27]) ).
fof(f30,plain,
~ ( ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X0)
& aInteger0(X0) ) )
& ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X1] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,X1)
& aInteger0(X1) ) ) ),
inference(rectify,[],[f28]) ).
fof(f34,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f35,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f34]) ).
fof(f62,plain,
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0) ) )
| ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ! [X1] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1) ) ) ),
inference(ennf_transformation,[],[f30]) ).
fof(f63,plain,
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ! [X1] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1) ) )
| ~ sP0 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f64,plain,
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0) ) )
| sP0 ),
inference(definition_folding,[],[f62,f63]) ).
fof(f73,plain,
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ! [X1] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1) ) )
| ~ sP0 ),
inference(nnf_transformation,[],[f63]) ).
fof(f74,plain,
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0)
| ~ aInteger0(X0) ) )
| ~ sP0 ),
inference(rectify,[],[f73]) ).
fof(f79,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f109,plain,
aInteger0(xp),
inference(cnf_transformation,[],[f23]) ).
fof(f111,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f23]) ).
fof(f118,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f25]) ).
fof(f120,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cnf_transformation,[],[f26]) ).
fof(f121,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(cnf_transformation,[],[f26]) ).
fof(f122,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0)
| ~ aInteger0(X0)
| ~ sP0 ),
inference(cnf_transformation,[],[f74]) ).
fof(f125,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0)
| sP0 ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_53,plain,
( ~ aInteger0(X0)
| ~ aInteger0(X1)
| aInteger0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_82,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f111]) ).
cnf(c_84,plain,
aInteger0(xp),
inference(cnf_transformation,[],[f109]) ).
cnf(c_93,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f118]) ).
cnf(c_94,plain,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtpldt0(xa,smndt0(xb)),
inference(cnf_transformation,[],[f121]) ).
cnf(c_95,plain,
sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)),
inference(cnf_transformation,[],[f120]) ).
cnf(c_98,plain,
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0)
| ~ aInteger0(X0)
| ~ sP0 ),
inference(cnf_transformation,[],[f122]) ).
cnf(c_101,negated_conjecture,
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0)
| sP0 ),
inference(cnf_transformation,[],[f125]) ).
cnf(c_2374,plain,
( ~ aInteger0(sdtasdt0(xp,xm))
| sP0 ),
inference(superposition,[status(thm)],[c_94,c_101]) ).
cnf(c_2606,plain,
( ~ aInteger0(xp)
| ~ aInteger0(xm)
| sP0 ),
inference(superposition,[status(thm)],[c_53,c_2374]) ).
cnf(c_2607,plain,
sP0,
inference(forward_subsumption_resolution,[status(thm)],[c_2606,c_93,c_84]) ).
cnf(c_2713,plain,
( ~ aInteger0(X0)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0) ),
inference(global_subsumption_just,[status(thm)],[c_98,c_98,c_2607]) ).
cnf(c_2714,plain,
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0)
| ~ aInteger0(X0) ),
inference(renaming,[status(thm)],[c_2713]) ).
cnf(c_2720,plain,
~ aInteger0(sdtasdt0(xq,xm)),
inference(superposition,[status(thm)],[c_95,c_2714]) ).
cnf(c_2807,plain,
( ~ aInteger0(xq)
| ~ aInteger0(xm) ),
inference(superposition,[status(thm)],[c_53,c_2720]) ).
cnf(c_2808,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2807,c_93,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM436+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Aug 25 08:35:23 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.26/1.16 % SZS status Started for theBenchmark.p
% 3.26/1.16 % SZS status Theorem for theBenchmark.p
% 3.26/1.16
% 3.26/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.26/1.16
% 3.26/1.16 ------ iProver source info
% 3.26/1.16
% 3.26/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.26/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.26/1.16 git: non_committed_changes: false
% 3.26/1.16 git: last_make_outside_of_git: false
% 3.26/1.16
% 3.26/1.16 ------ Parsing...
% 3.26/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.26/1.16
% 3.26/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.26/1.16
% 3.26/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.26/1.16
% 3.26/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.26/1.16 ------ Proving...
% 3.26/1.16 ------ Problem Properties
% 3.26/1.16
% 3.26/1.16
% 3.26/1.16 clauses 53
% 3.26/1.16 conjectures 3
% 3.26/1.16 EPR 17
% 3.26/1.16 Horn 46
% 3.26/1.16 unary 17
% 3.26/1.16 binary 16
% 3.26/1.16 lits 131
% 3.26/1.16 lits eq 35
% 3.26/1.16 fd_pure 0
% 3.26/1.16 fd_pseudo 0
% 3.26/1.16 fd_cond 7
% 3.26/1.16 fd_pseudo_cond 0
% 3.26/1.16 AC symbols 0
% 3.26/1.16
% 3.26/1.16 ------ Schedule dynamic 5 is on
% 3.26/1.16
% 3.26/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.26/1.16
% 3.26/1.16
% 3.26/1.16 ------
% 3.26/1.16 Current options:
% 3.26/1.16 ------
% 3.26/1.16
% 3.26/1.16
% 3.26/1.16
% 3.26/1.16
% 3.26/1.16 ------ Proving...
% 3.26/1.16
% 3.26/1.16
% 3.26/1.16 % SZS status Theorem for theBenchmark.p
% 3.26/1.16
% 3.26/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.26/1.16
% 3.26/1.16
%------------------------------------------------------------------------------