TSTP Solution File: DAT060_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : DAT060_1 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:14:19 EDT 2024
% Result : Theorem 1.96s 1.17s
% Output : CNFRefutation 2.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 93 ( 20 equ)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 28 ( 15 ~; 6 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 60 ( 60 fml; 0 var)
% Number arithmetic : 28 ( 9 atm; 0 fun; 0 num; 19 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 8 usr; 7 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 42 ( 1 sgn 29 !; 8 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
tff(f3,axiom,
! [X3: $int,X2: data,X1: array,X0: $int] :
( ( X0 != X3 )
=> ( get(put(X1,X3,X2),X0) = get(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_19) ).
tff(f6,conjecture,
! [X2: data,X1: array,X3: $int,X0: $int] :
( ~ $less(X3,X0)
| ( get(X1,X3) = get(put(X1,X0,X2),X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_lem_6) ).
tff(f7,negated_conjecture,
~ ! [X2: data,X1: array,X3: $int,X0: $int] :
( ~ $less(X3,X0)
| ( get(X1,X3) = get(put(X1,X0,X2),X3) ) ),
inference(negated_conjecture,[],[f6]) ).
tff(f13,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_145,[]) ).
tff(f21,plain,
! [X0: $int,X1: data,X2: array,X3: $int] :
( ( X0 != X3 )
=> ( get(put(X2,X0,X1),X3) = get(X2,X3) ) ),
inference(rectify,[],[f3]) ).
tff(f24,plain,
~ ! [X0: data,X1: array,X2: $int,X3: $int] :
( ~ $less(X2,X3)
| ( get(X1,X2) = get(put(X1,X3,X0),X2) ) ),
inference(rectify,[],[f7]) ).
tff(f25,plain,
! [X0: $int,X1: data,X2: array,X3: $int] :
( ( get(put(X2,X0,X1),X3) = get(X2,X3) )
| ( X0 = X3 ) ),
inference(ennf_transformation,[],[f21]) ).
tff(f26,plain,
? [X0: data,X1: array,X2: $int,X3: $int] :
( $less(X2,X3)
& ( get(X1,X2) != get(put(X1,X3,X0),X2) ) ),
inference(ennf_transformation,[],[f24]) ).
tff(f31,plain,
( ? [X0: data,X1: array,X2: $int,X3: $int] :
( $less(X2,X3)
& ( get(X1,X2) != get(put(X1,X3,X0),X2) ) )
=> ( $less(sK3,sK4)
& ( get(sK2,sK3) != get(put(sK2,sK4,sK1),sK3) ) ) ),
introduced(choice_axiom,[]) ).
tff(f32,plain,
( $less(sK3,sK4)
& ( get(sK2,sK3) != get(put(sK2,sK4,sK1),sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f26,f31]) ).
tff(f35,plain,
! [X2: array,X3: $int,X0: $int,X1: data] :
( ( get(put(X2,X0,X1),X3) = get(X2,X3) )
| ( X0 = X3 ) ),
inference(cnf_transformation,[],[f25]) ).
tff(f39,plain,
get(sK2,sK3) != get(put(sK2,sK4,sK1),sK3),
inference(cnf_transformation,[],[f32]) ).
tff(f40,plain,
$less(sK3,sK4),
inference(cnf_transformation,[],[f32]) ).
cnf(c_55,plain,
~ $less_int(X0_3,X0_3),
inference(cnf_transformation,[],[f13]) ).
cnf(c_63,plain,
( get(put(X0_14,X0_3,X0_13),X1_3) = get(X0_14,X1_3)
| X0_3 = X1_3 ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_66,negated_conjecture,
$less_int(sK3,sK4),
inference(cnf_transformation,[],[f40]) ).
cnf(c_67,negated_conjecture,
get(put(sK2,sK4,sK1),sK3) != get(sK2,sK3),
inference(cnf_transformation,[],[f39]) ).
cnf(c_1266,plain,
sK3 = sK4,
inference(superposition,[status(thm)],[c_63,c_67]) ).
cnf(c_1278,plain,
$less_int(sK3,sK3),
inference(demodulation,[status(thm)],[c_66,c_1266]) ).
cnf(c_1279,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1278,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : DAT060_1 : TPTP v8.1.2. Released v5.5.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n020.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 : Thu May 2 18:41:31 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running TFA theorem proving
% 0.21/0.48 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.96/1.17 % SZS status Started for theBenchmark.p
% 1.96/1.17 % SZS status Theorem for theBenchmark.p
% 1.96/1.17
% 1.96/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.96/1.17
% 1.96/1.17 ------ iProver source info
% 1.96/1.17
% 1.96/1.17 git: date: 2024-05-02 19:28:25 +0000
% 1.96/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.96/1.17 git: non_committed_changes: false
% 1.96/1.17
% 1.96/1.17 ------ Parsing...
% 1.96/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.96/1.17
% 1.96/1.17 ------ 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
% 1.96/1.17
% 1.96/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.96/1.17
% 1.96/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.96/1.17 ------ Proving...
% 1.96/1.17 ------ Problem Properties
% 1.96/1.17
% 1.96/1.17
% 1.96/1.17 clauses 19
% 1.96/1.17 conjectures 2
% 1.96/1.17 EPR 5
% 1.96/1.17 Horn 16
% 1.96/1.17 unary 13
% 1.96/1.17 binary 4
% 1.96/1.17 lits 27
% 1.96/1.17 lits eq 15
% 1.96/1.17 fd_pure 0
% 1.96/1.17 fd_pseudo 0
% 1.96/1.17 fd_cond 0
% 1.96/1.17 fd_pseudo_cond 3
% 1.96/1.17 AC symbols 1
% 1.96/1.17
% 1.96/1.17 ------ Input Options Time Limit: Unbounded
% 1.96/1.17
% 1.96/1.17
% 1.96/1.17 ------
% 1.96/1.17 Current options:
% 1.96/1.17 ------
% 1.96/1.17
% 1.96/1.17
% 1.96/1.17
% 1.96/1.17
% 1.96/1.17 ------ Proving...
% 1.96/1.17
% 1.96/1.17
% 1.96/1.17 % SZS status Theorem for theBenchmark.p
% 1.96/1.17
% 1.96/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.07/1.17
% 2.07/1.17
%------------------------------------------------------------------------------