TSTP Solution File: NUM913_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM913_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:51:04 EDT 2024
% Result : Theorem 1.11s 1.12s
% Output : CNFRefutation 1.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 119 ( 23 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 85 ( 32 ~; 38 |; 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: $real,X1: $real] :
( $lesseq(X0,X1)
<=> ( ( X0 = X1 )
| $less(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',real_combined_problem_1) ).
tff(f2,negated_conjecture,
~ ! [X0: $real,X1: $real] :
( $lesseq(X0,X1)
<=> ( ( X0 = X1 )
| $less(X0,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f3,plain,
~ ! [X0: $real,X1: $real] :
( ~ $less(X1,X0)
<=> ( ( X0 = X1 )
| $less(X0,X1) ) ),
inference(theory_normalization,[],[f2]) ).
tff(f9,plain,
! [X0: $real] : ~ $less(X0,X0),
introduced(theory_axiom_145,[]) ).
tff(f10,plain,
! [X2: $real,X0: $real,X1: $real] :
( ~ $less(X0,X1)
| ~ $less(X1,X2)
| $less(X0,X2) ),
introduced(theory_axiom_146,[]) ).
tff(f11,plain,
! [X0: $real,X1: $real] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_147,[]) ).
tff(f15,plain,
? [X0: $real,X1: $real] :
( ~ $less(X1,X0)
<~> ( ( X0 = X1 )
| $less(X0,X1) ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f16,plain,
? [X0: $real,X1: $real] :
( ( ( ( X0 != X1 )
& ~ $less(X0,X1) )
| $less(X1,X0) )
& ( ( X0 = X1 )
| $less(X0,X1)
| ~ $less(X1,X0) ) ),
inference(nnf_transformation,[],[f15]) ).
tff(f17,plain,
? [X0: $real,X1: $real] :
( ( ( ( X0 != X1 )
& ~ $less(X0,X1) )
| $less(X1,X0) )
& ( ( X0 = X1 )
| $less(X0,X1)
| ~ $less(X1,X0) ) ),
inference(flattening,[],[f16]) ).
tff(f18,plain,
( ? [X0: $real,X1: $real] :
( ( ( ( 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(f19,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])],[f17,f18]) ).
tff(f20,plain,
( ( sK0 = sK1 )
| $less(sK0,sK1)
| ~ $less(sK1,sK0) ),
inference(cnf_transformation,[],[f19]) ).
tff(f21,plain,
( ~ $less(sK0,sK1)
| $less(sK1,sK0) ),
inference(cnf_transformation,[],[f19]) ).
tff(f22,plain,
( ( sK0 != sK1 )
| $less(sK1,sK0) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_52,plain,
( X0_2 = X1_2
| $less_real(X0_2,X1_2)
| $less_real(X1_2,X0_2) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_53,plain,
( ~ $less_real(X0_2,X1_2)
| ~ $less_real(X1_2,X2_2)
| $less_real(X0_2,X2_2) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_54,plain,
~ $less_real(X0_2,X0_2),
inference(cnf_transformation,[],[f9]) ).
cnf(c_60,negated_conjecture,
( sK0 != sK1
| $less_real(sK1,sK0) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_61,negated_conjecture,
( ~ $less_real(sK0,sK1)
| $less_real(sK1,sK0) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_62,negated_conjecture,
( ~ $less_real(sK1,sK0)
| sK0 = sK1
| $less_real(sK0,sK1) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_111,plain,
( sK0 = sK1
| $less_real(sK0,sK1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_62,c_52]) ).
cnf(c_155,negated_conjecture,
$less_real(sK1,sK0),
inference(global_subsumption_just,[status(thm)],[c_61,c_61,c_60,c_111]) ).
cnf(c_157,negated_conjecture,
$less_real(sK1,sK0),
inference(global_subsumption_just,[status(thm)],[c_60,c_155]) ).
cnf(c_470,plain,
( ~ $less_real(X0_2,sK1)
| $less_real(X0_2,sK0) ),
inference(superposition,[status(thm)],[c_157,c_53]) ).
cnf(c_542,plain,
( sK0 = sK1
| $less_real(sK0,sK0) ),
inference(superposition,[status(thm)],[c_111,c_470]) ).
cnf(c_543,plain,
sK0 = sK1,
inference(forward_subsumption_resolution,[status(thm)],[c_542,c_54]) ).
cnf(c_548,plain,
$less_real(sK0,sK0),
inference(demodulation,[status(thm)],[c_157,c_543]) ).
cnf(c_549,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_548,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM913_1 : TPTP v8.1.2. Released v5.0.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n019.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 19:39:29 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running TFA theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.11/1.12 % SZS status Started for theBenchmark.p
% 1.11/1.12 % SZS status Theorem for theBenchmark.p
% 1.11/1.12
% 1.11/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.11/1.12
% 1.11/1.12 ------ iProver source info
% 1.11/1.12
% 1.11/1.12 git: date: 2024-05-02 19:28:25 +0000
% 1.11/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.11/1.12 git: non_committed_changes: false
% 1.11/1.12
% 1.11/1.12 ------ Parsing...
% 1.11/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.11/1.12
% 1.11/1.12 ------ 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.11/1.12
% 1.11/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.11/1.12
% 1.11/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.11/1.12 ------ Proving...
% 1.11/1.12 ------ Problem Properties
% 1.11/1.12
% 1.11/1.12
% 1.11/1.12 clauses 13
% 1.11/1.12 conjectures 1
% 1.11/1.12 EPR 6
% 1.11/1.12 Horn 10
% 1.11/1.12 unary 9
% 1.11/1.12 binary 2
% 1.11/1.12 lits 19
% 1.11/1.12 lits eq 8
% 1.11/1.12 fd_pure 0
% 1.11/1.12 fd_pseudo 0
% 1.11/1.12 fd_cond 0
% 1.11/1.12 fd_pseudo_cond 1
% 1.11/1.12 AC symbols 1
% 1.11/1.12
% 1.11/1.12 ------ Input Options Time Limit: Unbounded
% 1.11/1.12
% 1.11/1.12
% 1.11/1.12 ------
% 1.11/1.12 Current options:
% 1.11/1.12 ------
% 1.11/1.12
% 1.11/1.12
% 1.11/1.12
% 1.11/1.12
% 1.11/1.12 ------ Proving...
% 1.11/1.12
% 1.11/1.12
% 1.11/1.12 % SZS status Theorem for theBenchmark.p
% 1.11/1.12
% 1.11/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.11/1.12
% 1.11/1.12
%------------------------------------------------------------------------------