TSTP Solution File: NUM299+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM299+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:29:18 EDT 2023
% Result : Theorem 9.98s 2.17s
% Output : CNFRefutation 9.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 20 unt; 0 def)
% Number of atoms : 85 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 86 ( 40 ~; 32 |; 10 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 52 ( 0 sgn; 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f130,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdnn2) ).
fof(f132,axiom,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdnn4) ).
fof(f268,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_positive_less23) ).
fof(f269,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_positive_less34) ).
fof(f275,axiom,
! [X0,X1,X2] :
( ( rdn_positive_less(rdnn(X1),rdnn(X2))
& rdn_positive_less(rdnn(X0),rdnn(X1)) )
=> rdn_positive_less(rdnn(X0),rdnn(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_positive_less_transitivity) ).
fof(f283,axiom,
! [X0,X1,X9,X10] :
( ( rdn_positive_less(X10,X9)
& rdn_translate(X1,rdn_neg(X10))
& rdn_translate(X0,rdn_neg(X9)) )
=> less(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_entry_point_neg_neg) ).
fof(f284,axiom,
! [X0,X1] :
( less(X0,X1)
<=> ( X0 != X1
& ~ less(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
fof(f402,conjecture,
~ less(nn2,nn4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nn2_not_less_nn4) ).
fof(f403,negated_conjecture,
~ ~ less(nn2,nn4),
inference(negated_conjecture,[],[f402]) ).
fof(f410,plain,
! [X0,X1,X2,X3] :
( ( rdn_positive_less(X3,X2)
& rdn_translate(X1,rdn_neg(X3))
& rdn_translate(X0,rdn_neg(X2)) )
=> less(X0,X1) ),
inference(rectify,[],[f283]) ).
fof(f425,plain,
less(nn2,nn4),
inference(flattening,[],[f403]) ).
fof(f427,plain,
! [X0,X1,X2] :
( rdn_positive_less(rdnn(X0),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1)) ),
inference(ennf_transformation,[],[f275]) ).
fof(f428,plain,
! [X0,X1,X2] :
( rdn_positive_less(rdnn(X0),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1)) ),
inference(flattening,[],[f427]) ).
fof(f439,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_positive_less(X3,X2)
| ~ rdn_translate(X1,rdn_neg(X3))
| ~ rdn_translate(X0,rdn_neg(X2)) ),
inference(ennf_transformation,[],[f410]) ).
fof(f440,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_positive_less(X3,X2)
| ~ rdn_translate(X1,rdn_neg(X3))
| ~ rdn_translate(X0,rdn_neg(X2)) ),
inference(flattening,[],[f439]) ).
fof(f472,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1
| less(X1,X0) )
& ( ( X0 != X1
& ~ less(X1,X0) )
| ~ less(X0,X1) ) ),
inference(nnf_transformation,[],[f284]) ).
fof(f473,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1
| less(X1,X0) )
& ( ( X0 != X1
& ~ less(X1,X0) )
| ~ less(X0,X1) ) ),
inference(flattening,[],[f472]) ).
fof(f604,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f130]) ).
fof(f606,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(cnf_transformation,[],[f132]) ).
fof(f742,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf_transformation,[],[f268]) ).
fof(f743,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(cnf_transformation,[],[f269]) ).
fof(f749,plain,
! [X2,X0,X1] :
( rdn_positive_less(rdnn(X0),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1)) ),
inference(cnf_transformation,[],[f428]) ).
fof(f757,plain,
! [X2,X3,X0,X1] :
( less(X0,X1)
| ~ rdn_positive_less(X3,X2)
| ~ rdn_translate(X1,rdn_neg(X3))
| ~ rdn_translate(X0,rdn_neg(X2)) ),
inference(cnf_transformation,[],[f440]) ).
fof(f758,plain,
! [X0,X1] :
( ~ less(X1,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f473]) ).
fof(f879,plain,
less(nn2,nn4),
inference(cnf_transformation,[],[f425]) ).
cnf(c_178,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f604]) ).
cnf(c_180,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(cnf_transformation,[],[f606]) ).
cnf(c_316,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf_transformation,[],[f742]) ).
cnf(c_317,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(cnf_transformation,[],[f743]) ).
cnf(c_323,plain,
( ~ rdn_positive_less(rdnn(X0),rdnn(X1))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| rdn_positive_less(rdnn(X0),rdnn(X2)) ),
inference(cnf_transformation,[],[f749]) ).
cnf(c_331,plain,
( ~ rdn_translate(X0,rdn_neg(X1))
| ~ rdn_translate(X2,rdn_neg(X3))
| ~ rdn_positive_less(X3,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f757]) ).
cnf(c_334,plain,
( ~ less(X0,X1)
| ~ less(X1,X0) ),
inference(cnf_transformation,[],[f758]) ).
cnf(c_453,negated_conjecture,
less(nn2,nn4),
inference(cnf_transformation,[],[f879]) ).
cnf(c_5092,plain,
~ less(nn4,nn2),
inference(superposition,[status(thm)],[c_453,c_334]) ).
cnf(c_7994,plain,
( ~ rdn_positive_less(rdnn(n3),rdnn(X0))
| rdn_positive_less(rdnn(n2),rdnn(X0)) ),
inference(superposition,[status(thm)],[c_316,c_323]) ).
cnf(c_8210,plain,
rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(superposition,[status(thm)],[c_317,c_7994]) ).
cnf(c_9627,plain,
( ~ rdn_translate(X0,rdn_neg(X1))
| ~ rdn_positive_less(X1,rdnn(n4))
| less(nn4,X0) ),
inference(superposition,[status(thm)],[c_180,c_331]) ).
cnf(c_38442,plain,
( ~ rdn_positive_less(rdnn(n2),rdnn(n4))
| less(nn4,nn2) ),
inference(superposition,[status(thm)],[c_178,c_9627]) ).
cnf(c_38569,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_38442,c_8210,c_5092]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM299+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n024.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:00:39 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 9.98/2.17 % SZS status Started for theBenchmark.p
% 9.98/2.17 % SZS status Theorem for theBenchmark.p
% 9.98/2.17
% 9.98/2.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 9.98/2.17
% 9.98/2.17 ------ iProver source info
% 9.98/2.17
% 9.98/2.17 git: date: 2023-05-31 18:12:56 +0000
% 9.98/2.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 9.98/2.17 git: non_committed_changes: false
% 9.98/2.17 git: last_make_outside_of_git: false
% 9.98/2.17
% 9.98/2.17 ------ Parsing...
% 9.98/2.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 9.98/2.17
% 9.98/2.17 ------ 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: 1 0s sf_e pe_s pe_e
% 9.98/2.17
% 9.98/2.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 9.98/2.17
% 9.98/2.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 9.98/2.17 ------ Proving...
% 9.98/2.17 ------ Problem Properties
% 9.98/2.17
% 9.98/2.17
% 9.98/2.17 clauses 402
% 9.98/2.17 conjectures 1
% 9.98/2.17 EPR 8
% 9.98/2.17 Horn 400
% 9.98/2.17 unary 376
% 9.98/2.17 binary 6
% 9.98/2.17 lits 472
% 9.98/2.17 lits eq 5
% 9.98/2.17 fd_pure 0
% 9.98/2.17 fd_pseudo 0
% 9.98/2.17 fd_cond 0
% 9.98/2.17 fd_pseudo_cond 5
% 9.98/2.17 AC symbols 0
% 9.98/2.17
% 9.98/2.17 ------ Input Options Time Limit: Unbounded
% 9.98/2.17
% 9.98/2.17
% 9.98/2.17 ------
% 9.98/2.17 Current options:
% 9.98/2.17 ------
% 9.98/2.17
% 9.98/2.17
% 9.98/2.17
% 9.98/2.17
% 9.98/2.17 ------ Proving...
% 9.98/2.17
% 9.98/2.17
% 9.98/2.17 ------ Proving...
% 9.98/2.17
% 9.98/2.17
% 9.98/2.17 ------ Proving...
% 9.98/2.17
% 9.98/2.17
% 9.98/2.17 ------ Proving...
% 9.98/2.17
% 9.98/2.17
% 9.98/2.17 ------ Proving...
% 9.98/2.17
% 9.98/2.17
% 9.98/2.17 ------ Proving...
% 9.98/2.17
% 9.98/2.17
% 9.98/2.17 % SZS status Theorem for theBenchmark.p
% 9.98/2.17
% 9.98/2.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.98/2.17
% 9.98/2.17
%------------------------------------------------------------------------------