TSTP Solution File: NUM852+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM852+2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:33:16 EDT 2023
% Result : Theorem 3.56s 1.14s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f54)
% Comments :
%------------------------------------------------------------------------------
fof(f48,plain,
! [X0,X1] :
( ? [X3] : vplus(X1,X3) = X0
=> vplus(X1,sK0(X0,X1)) = X0 ),
introduced(choice_axiom,[]) ).
cnf(c_49,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(cnf_transformation,[],[f54]) ).
cnf(c_51,plain,
less(vd480,vd481),
inference(cnf_transformation,[],[f56]) ).
cnf(c_56,plain,
vmul(vmul(X0,X1),X2) = vmul(X0,vmul(X1,X2)),
inference(cnf_transformation,[],[f62]) ).
cnf(c_57,plain,
vplus(vmul(X0,X1),vmul(X0,X2)) = vmul(X0,vplus(X1,X2)),
inference(cnf_transformation,[],[f63]) ).
cnf(c_58,plain,
vmul(X0,X1) = vmul(X1,X0),
inference(cnf_transformation,[],[f64]) ).
cnf(c_68,plain,
greater(vplus(X0,X1),X0),
inference(cnf_transformation,[],[f80]) ).
cnf(c_79,negated_conjecture,
~ greater(vmul(vd469,vd481),vmul(vd469,vd480)),
inference(theory_normalisation,[status(thm)],[c_49,c_56,c_58]) ).
cnf(c_1423,plain,
greater(vmul(X0,vplus(X1,X2)),vmul(X0,X1)),
inference(superposition,[status(thm)],[c_57,c_68]) ).
fof(f20,axiom,
! [X20,X21] :
( less(X21,X20)
<=> ? [X22] : vplus(X21,X22) = X20 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).
fof(f79,plain,
! [X2,X1] : less(X1,vplus(X1,X2)),
inference(equality_resolution,[],[f73]) ).
fof(f37,plain,
! [X0,X1] :
( less(X1,X0)
<=> ? [X2] : vplus(X1,X2) = X0 ),
inference(rectify,[],[f20]) ).
fof(f46,plain,
! [X0,X1] :
( ( less(X1,X0)
| ! [X2] : vplus(X1,X2) != X0 )
& ( ? [X2] : vplus(X1,X2) = X0
| ~ less(X1,X0) ) ),
inference(nnf_transformation,[],[f37]) ).
fof(f47,plain,
! [X0,X1] :
( ( less(X1,X0)
| ! [X2] : vplus(X1,X2) != X0 )
& ( ? [X3] : vplus(X1,X3) = X0
| ~ less(X1,X0) ) ),
inference(rectify,[],[f46]) ).
fof(f49,plain,
! [X0,X1] :
( ( less(X1,X0)
| ! [X2] : vplus(X1,X2) != X0 )
& ( vplus(X1,sK0(X0,X1)) = X0
| ~ less(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f47,f48]) ).
fof(f72,plain,
! [X0,X1] :
( vplus(X1,sK0(X0,X1)) = X0
| ~ less(X1,X0) ),
inference(cnf_transformation,[],[f49]) ).
fof(f73,plain,
! [X2,X0,X1] :
( less(X1,X0)
| vplus(X1,X2) != X0 ),
inference(cnf_transformation,[],[f49]) ).
cnf(c_67,plain,
( ~ less(X0,X1)
| vplus(X0,sK0(X1,X0)) = X1 ),
inference(cnf_transformation,[],[f72]) ).
cnf(c_1357,plain,
vplus(vd480,sK0(vd481,vd480)) = vd481,
inference(superposition,[status(thm)],[c_51,c_67]) ).
cnf(c_1668,plain,
greater(vmul(X0,vd481),vmul(X0,vd480)),
inference(superposition,[status(thm)],[c_1357,c_1423]) ).
cnf(c_1687,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_79,c_1668]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM852+2 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n011.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 10:29:08 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.56/1.14 % SZS status Started for theBenchmark.p
% 3.56/1.14 % SZS status Theorem for theBenchmark.p
% 3.56/1.14
% 3.56/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.56/1.14
% 3.56/1.14 ------ iProver source info
% 3.56/1.14
% 3.56/1.14 git: date: 2023-05-31 18:12:56 +0000
% 3.56/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.56/1.14 git: non_committed_changes: false
% 3.56/1.14 git: last_make_outside_of_git: false
% 3.56/1.14
% 3.56/1.14 ------ Parsing...
% 3.56/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.56/1.14
% 3.56/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.56/1.14
% 3.56/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.56/1.14
% 3.56/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.56/1.14 ------ Proving...
% 3.56/1.14 ------ Problem Properties
% 3.56/1.14
% 3.56/1.14
% 3.56/1.14 clauses 20
% 3.56/1.14 conjectures 1
% 3.56/1.14 EPR 8
% 3.56/1.14 Horn 19
% 3.56/1.14 unary 11
% 3.56/1.14 binary 8
% 3.56/1.14 lits 30
% 3.56/1.15 lits eq 10
% 3.56/1.15 fd_pure 0
% 3.56/1.15 fd_pseudo 0
% 3.56/1.15 fd_cond 0
% 3.56/1.15 fd_pseudo_cond 1
% 3.56/1.15 AC symbols 1
% 3.56/1.15
% 3.56/1.15 ------ Schedule dynamic 5 is on
% 3.56/1.15
% 3.56/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.56/1.15
% 3.56/1.15
% 3.56/1.15 ------
% 3.56/1.15 Current options:
% 3.56/1.15 ------
% 3.56/1.15
% 3.56/1.15
% 3.56/1.15
% 3.56/1.15
% 3.56/1.15 ------ Proving...
% 3.56/1.15
% 3.56/1.15
% 3.56/1.15 % SZS status Theorem for theBenchmark.p
% 3.56/1.15
% 3.56/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.56/1.15
% 3.56/1.15
%------------------------------------------------------------------------------