TSTP Solution File: NUM892_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM892_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:27 EDT 2023
% Result : Theorem 1.19s 1.15s
% Output : CNFRefutation 1.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 125 ( 25 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 90 ( 34 ~; 41 |; 10 &)
% ( 3 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 38 ( 38 fml; 0 var)
% Number arithmetic : 59 ( 39 atm; 0 fun; 0 num; 20 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 27 ( 0 sgn; 12 !; 8 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,conjecture,
! [X0: $int,X1: $int] :
( $lesseq(X0,X1)
<=> ( ( X0 = X1 )
| $less(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_lesseq) ).
tff(f2,negated_conjecture,
~ ! [X0: $int,X1: $int] :
( $lesseq(X0,X1)
<=> ( ( X0 = X1 )
| $less(X0,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f3,plain,
~ ! [X0: $int,X1: $int] :
( ~ $less(X1,X0)
<=> ( ( X0 = X1 )
| $less(X0,X1) ) ),
inference(theory_normalization,[],[f2]) ).
tff(f9,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_145,[]) ).
tff(f10,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X0,X1)
| ~ $less(X1,X2)
| $less(X0,X2) ),
introduced(theory_axiom_146,[]) ).
tff(f11,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_147,[]) ).
tff(f16,plain,
? [X0: $int,X1: $int] :
( ~ $less(X1,X0)
<~> ( ( X0 = X1 )
| $less(X0,X1) ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f17,plain,
? [X0: $int,X1: $int] :
( ( ( ( X0 != X1 )
& ~ $less(X0,X1) )
| $less(X1,X0) )
& ( ( X0 = X1 )
| $less(X0,X1)
| ~ $less(X1,X0) ) ),
inference(nnf_transformation,[],[f16]) ).
tff(f18,plain,
? [X0: $int,X1: $int] :
( ( ( ( X0 != X1 )
& ~ $less(X0,X1) )
| $less(X1,X0) )
& ( ( X0 = X1 )
| $less(X0,X1)
| ~ $less(X1,X0) ) ),
inference(flattening,[],[f17]) ).
tff(f19,plain,
( ? [X0: $int,X1: $int] :
( ( ( ( X0 != X1 )
& ~ $less(X0,X1) )
| $less(X1,X0) )
& ( ( X0 = X1 )
| $less(X0,X1)
| ~ $less(X1,X0) ) )
=> ( ( ( ( sK0 != sK1 )
& ~ $less(sK0,sK1) )
| $less(sK1,sK0) )
& ( ( sK0 = sK1 )
| $less(sK0,sK1)
| ~ $less(sK1,sK0) ) ) ),
introduced(choice_axiom,[]) ).
tff(f20,plain,
( ( ( ( sK0 != sK1 )
& ~ $less(sK0,sK1) )
| $less(sK1,sK0) )
& ( ( sK0 = sK1 )
| $less(sK0,sK1)
| ~ $less(sK1,sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f18,f19]) ).
tff(f21,plain,
( ( sK0 = sK1 )
| $less(sK0,sK1)
| ~ $less(sK1,sK0) ),
inference(cnf_transformation,[],[f20]) ).
tff(f22,plain,
( ~ $less(sK0,sK1)
| $less(sK1,sK0) ),
inference(cnf_transformation,[],[f20]) ).
tff(f23,plain,
( ( sK0 != sK1 )
| $less(sK1,sK0) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_53,plain,
( X0_3 = X1_3
| $less_int(X0_3,X1_3)
| $less_int(X1_3,X0_3) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_54,plain,
( ~ $less_int(X0_3,X1_3)
| ~ $less_int(X1_3,X2_3)
| $less_int(X0_3,X2_3) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_55,plain,
~ $less_int(X0_3,X0_3),
inference(cnf_transformation,[],[f9]) ).
cnf(c_61,negated_conjecture,
( sK0 != sK1
| $less_int(sK1,sK0) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_62,negated_conjecture,
( ~ $less_int(sK0,sK1)
| $less_int(sK1,sK0) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_63,negated_conjecture,
( ~ $less_int(sK1,sK0)
| sK0 = sK1
| $less_int(sK0,sK1) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_80,plain,
( sK0 != sK1
| $less_int(sK1,sK0) ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
cnf(c_82,plain,
( ~ $less_int(sK0,sK1)
| $less_int(sK1,sK0) ),
inference(prop_impl_just,[status(thm)],[c_62]) ).
cnf(c_158,plain,
( sK0 = sK1
| $less_int(sK0,sK1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_63,c_53]) ).
cnf(c_206,plain,
$less_int(sK1,sK0),
inference(global_subsumption_just,[status(thm)],[c_82,c_62,c_61,c_158]) ).
cnf(c_208,plain,
$less_int(sK1,sK0),
inference(global_subsumption_just,[status(thm)],[c_80,c_206]) ).
cnf(c_314,plain,
( sK0 = sK1
| $less_int(sK0,sK1) ),
inference(prop_impl_just,[status(thm)],[c_158]) ).
cnf(c_704,plain,
( ~ $less_int(sK0,X0_3)
| $less_int(sK1,X0_3) ),
inference(superposition,[status(thm)],[c_208,c_54]) ).
cnf(c_798,plain,
( sK0 = sK1
| $less_int(sK1,sK1) ),
inference(superposition,[status(thm)],[c_314,c_704]) ).
cnf(c_805,plain,
sK0 = sK1,
inference(forward_subsumption_resolution,[status(thm)],[c_798,c_55]) ).
cnf(c_812,plain,
$less_int(sK0,sK0),
inference(demodulation,[status(thm)],[c_208,c_805]) ).
cnf(c_813,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_812,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUM892_1 : TPTP v8.1.2. Released v5.0.0.
% 0.11/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n031.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 14:41:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running TFA theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.19/1.15 % SZS status Started for theBenchmark.p
% 1.19/1.15 % SZS status Theorem for theBenchmark.p
% 1.19/1.15
% 1.19/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.19/1.15
% 1.19/1.15 ------ iProver source info
% 1.19/1.15
% 1.19/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.19/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.19/1.15 git: non_committed_changes: false
% 1.19/1.15 git: last_make_outside_of_git: false
% 1.19/1.15
% 1.19/1.15 ------ Parsing...
% 1.19/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.19/1.15
% 1.19/1.15 ------ Preprocessing... sup_sim: 1 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 sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 1.19/1.15
% 1.19/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.19/1.15
% 1.19/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.19/1.15 ------ Proving...
% 1.19/1.15 ------ Problem Properties
% 1.19/1.15
% 1.19/1.15
% 1.19/1.15 clauses 14
% 1.19/1.15 conjectures 0
% 1.19/1.15 EPR 6
% 1.19/1.15 Horn 11
% 1.19/1.15 unary 9
% 1.19/1.15 binary 3
% 1.19/1.15 lits 21
% 1.19/1.15 lits eq 8
% 1.19/1.15 fd_pure 0
% 1.19/1.15 fd_pseudo 0
% 1.19/1.15 fd_cond 0
% 1.19/1.15 fd_pseudo_cond 1
% 1.19/1.15 AC symbols 1
% 1.19/1.15
% 1.19/1.15 ------ Input Options Time Limit: Unbounded
% 1.19/1.15
% 1.19/1.15
% 1.19/1.15 ------
% 1.19/1.15 Current options:
% 1.19/1.15 ------
% 1.19/1.15
% 1.19/1.15
% 1.19/1.15
% 1.19/1.15
% 1.19/1.15 ------ Proving...
% 1.19/1.15
% 1.19/1.15
% 1.19/1.15 % SZS status Theorem for theBenchmark.p
% 1.19/1.15
% 1.19/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.19/1.15
% 1.19/1.15
%------------------------------------------------------------------------------