TSTP Solution File: NUM435+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM435+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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 : Fri May 3 02:49:16 EDT 2024
% Result : Theorem 35.34s 5.70s
% Output : CNFRefutation 35.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 19 unt; 0 def)
% Number of atoms : 98 ( 57 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 105 ( 50 ~; 44 |; 9 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0,X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1)
& aInteger0(X0) )
=> sdtasdt0(X0,sdtasdt0(X1,X2)) = sdtasdt0(sdtasdt0(X0,X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulAsso) ).
fof(f12,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
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,
( sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1032) ).
fof(f26,conjecture,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f27,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(negated_conjecture,[],[f26]) ).
fof(f29,plain,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(flattening,[],[f27]) ).
fof(f41,plain,
! [X0,X1,X2] :
( sdtasdt0(X0,sdtasdt0(X1,X2)) = sdtasdt0(sdtasdt0(X0,X1),X2)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f42,plain,
! [X0,X1,X2] :
( sdtasdt0(X0,sdtasdt0(X1,X2)) = sdtasdt0(sdtasdt0(X0,X1),X2)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f41]) ).
fof(f43,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f44,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f43]) ).
fof(f78,plain,
! [X2,X0,X1] :
( sdtasdt0(X0,sdtasdt0(X1,X2)) = sdtasdt0(sdtasdt0(X0,X1),X2)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f79,plain,
! [X0,X1] :
( sdtasdt0(X0,X1) = sdtasdt0(X1,X0)
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f101,plain,
aInteger0(xp),
inference(cnf_transformation,[],[f23]) ).
fof(f103,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f23]) ).
fof(f106,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f25]) ).
fof(f107,plain,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
inference(cnf_transformation,[],[f25]) ).
fof(f108,plain,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(cnf_transformation,[],[f29]) ).
cnf(c_60,plain,
( ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sdtasdt0(sdtasdt0(X0,X1),X2) = sdtasdt0(X0,sdtasdt0(X1,X2)) ),
inference(cnf_transformation,[],[f78]) ).
cnf(c_61,plain,
( ~ aInteger0(X0)
| ~ aInteger0(X1)
| sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_82,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f103]) ).
cnf(c_84,plain,
aInteger0(xp),
inference(cnf_transformation,[],[f101]) ).
cnf(c_88,plain,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
inference(cnf_transformation,[],[f107]) ).
cnf(c_89,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f106]) ).
cnf(c_90,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtpldt0(xa,smndt0(xb)),
inference(cnf_transformation,[],[f108]) ).
cnf(c_531,plain,
X0 = X0,
theory(equality) ).
cnf(c_533,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_1241,plain,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(instantiation,[status(thm)],[c_531]) ).
cnf(c_1493,plain,
( sdtasdt0(xq,sdtasdt0(xp,xm)) != X0
| X1 != X0
| sdtasdt0(xq,sdtasdt0(xp,xm)) = X1 ),
inference(instantiation,[status(thm)],[c_533]) ).
cnf(c_1525,plain,
( sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(xq,sdtasdt0(xp,xm))
| X0 != sdtasdt0(xq,sdtasdt0(xp,xm))
| sdtasdt0(xq,sdtasdt0(xp,xm)) = X0 ),
inference(instantiation,[status(thm)],[c_1493]) ).
cnf(c_1624,plain,
( sdtasdt0(sdtasdt0(xq,xp),xm) != sdtasdt0(xq,sdtasdt0(xp,xm))
| sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(xq,sdtasdt0(xp,xm))
| sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtasdt0(sdtasdt0(xq,xp),xm) ),
inference(instantiation,[status(thm)],[c_1525]) ).
cnf(c_2026,plain,
( ~ aInteger0(xq)
| ~ aInteger0(xp)
| ~ aInteger0(xm)
| sdtasdt0(sdtasdt0(xq,xp),xm) = sdtasdt0(xq,sdtasdt0(xp,xm)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_3708,plain,
( ~ aInteger0(X0)
| sdtasdt0(X0,xq) = sdtasdt0(xq,X0) ),
inference(superposition,[status(thm)],[c_82,c_61]) ).
cnf(c_5298,plain,
( sdtasdt0(xq,sdtasdt0(xp,xm)) != X0
| sdtpldt0(xa,smndt0(xb)) != X0
| sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtpldt0(xa,smndt0(xb)) ),
inference(instantiation,[status(thm)],[c_533]) ).
cnf(c_5305,plain,
( sdtpldt0(xa,smndt0(xb)) != X0
| X1 != X0
| sdtpldt0(xa,smndt0(xb)) = X1 ),
inference(instantiation,[status(thm)],[c_533]) ).
cnf(c_5340,plain,
( sdtpldt0(xa,smndt0(xb)) != sdtpldt0(xa,smndt0(xb))
| X0 != sdtpldt0(xa,smndt0(xb))
| sdtpldt0(xa,smndt0(xb)) = X0 ),
inference(instantiation,[status(thm)],[c_5305]) ).
cnf(c_5486,plain,
sdtpldt0(xa,smndt0(xb)) = sdtpldt0(xa,smndt0(xb)),
inference(instantiation,[status(thm)],[c_531]) ).
cnf(c_5764,plain,
( sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(X0,X1)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(X0,X1)
| sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtpldt0(xa,smndt0(xb)) ),
inference(instantiation,[status(thm)],[c_5298]) ).
cnf(c_11547,plain,
sdtasdt0(xq,xp) = sdtasdt0(xp,xq),
inference(superposition,[status(thm)],[c_84,c_3708]) ).
cnf(c_12922,plain,
( sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(sdtasdt0(xq,xp),xm)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(sdtasdt0(xq,xp),xm)
| sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtpldt0(xa,smndt0(xb)) ),
inference(instantiation,[status(thm)],[c_5764]) ).
cnf(c_13887,plain,
( sdtasdt0(sdtasdt0(xq,xp),xm) != sdtpldt0(xa,smndt0(xb))
| sdtpldt0(xa,smndt0(xb)) != sdtpldt0(xa,smndt0(xb))
| sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xq,xp),xm) ),
inference(instantiation,[status(thm)],[c_5340]) ).
cnf(c_14824,plain,
sdtasdt0(sdtasdt0(xq,xp),xm) = sdtpldt0(xa,smndt0(xb)),
inference(superposition,[status(thm)],[c_11547,c_88]) ).
cnf(c_14826,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_14824,c_13887,c_12922,c_5486,c_2026,c_1624,c_1241,c_90,c_82,c_84,c_89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUM435+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n014.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 19:31:17 EDT 2024
% 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 35.34/5.70 % SZS status Started for theBenchmark.p
% 35.34/5.70 % SZS status Theorem for theBenchmark.p
% 35.34/5.70
% 35.34/5.70 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 35.34/5.70
% 35.34/5.70 ------ iProver source info
% 35.34/5.70
% 35.34/5.70 git: date: 2024-05-02 19:28:25 +0000
% 35.34/5.70 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 35.34/5.70 git: non_committed_changes: false
% 35.34/5.70
% 35.34/5.70 ------ Parsing...
% 35.34/5.70 ------ Clausification by vclausify_rel & Parsing by iProver...
% 35.34/5.70
% 35.34/5.70 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 35.34/5.70
% 35.34/5.70 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 35.34/5.70
% 35.34/5.70 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 35.34/5.70 ------ Proving...
% 35.34/5.70 ------ Problem Properties
% 35.34/5.70
% 35.34/5.70
% 35.34/5.70 clauses 42
% 35.34/5.70 conjectures 1
% 35.34/5.70 EPR 14
% 35.34/5.70 Horn 35
% 35.34/5.70 unary 12
% 35.34/5.70 binary 12
% 35.34/5.70 lits 112
% 35.34/5.70 lits eq 30
% 35.34/5.70 fd_pure 0
% 35.34/5.71 fd_pseudo 0
% 35.34/5.71 fd_cond 7
% 35.34/5.71 fd_pseudo_cond 0
% 35.34/5.71 AC symbols 0
% 35.34/5.71
% 35.34/5.71 ------ Input Options Time Limit: Unbounded
% 35.34/5.71
% 35.34/5.71
% 35.34/5.71 ------
% 35.34/5.71 Current options:
% 35.34/5.71 ------
% 35.34/5.71
% 35.34/5.71
% 35.34/5.71
% 35.34/5.71
% 35.34/5.71 ------ Proving...
% 35.34/5.71
% 35.34/5.71
% 35.34/5.71 % SZS status Theorem for theBenchmark.p
% 35.34/5.71
% 35.34/5.71 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 35.34/5.71
% 35.34/5.71
%------------------------------------------------------------------------------