TSTP Solution File: ARI748_1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : ARI748_1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 : Wed Aug 30 17:41:58 EDT 2023
% Result : Unsatisfiable 11.83s 2.11s
% Output : CNFRefutation 11.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 424 ( 114 equ)
% Maximal formula atoms : 16 ( 11 avg)
% Number of connectives : 173 ( 62 ~; 45 |; 59 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 276 ( 276 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 8 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 118 ( 0 sgn; 76 !; 38 ?; 114 :)
% Comments :
%------------------------------------------------------------------------------
tff(f44,axiom,
! [X84: c_type,X85: c_unsorted,X86: c_unsorted] :
? [X87: c_type] :
( ? [X88: c_sorted,X89: c_sorted,X90: c_type] :
( ( same_block(X88,X89)
<=> ( c_sort(X90,base_block(X88)) = c_sort(X90,base_block(X89)) ) )
& ( block(X84) = X90 )
& ( c_sort(X87,X86) = X89 )
& ( c_sort(X87,X85) = X88 ) )
& ( pointer(X84) = X87 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_44) ).
tff(f184,axiom,
~ ! [X866: c_unsorted,X867: c_unsorted] :
? [X868: c_type] :
( ? [X869: c_sorted,X870: c_sorted] :
( ( ( ~ same_block(X869,X870)
& ( c_Boolean_true = c_Boolean_true ) )
=> ( X869 != X870 ) )
& ( c_sort(X868,X867) = X870 )
& ( c_sort(X868,X866) = X869 ) )
& ( pointer(int_P) = X868 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_184) ).
tff(f311,plain,
! [X0: c_type,X1: c_unsorted,X2: c_unsorted] :
? [X3: c_type] :
( ? [X4: c_sorted,X5: c_sorted,X6: c_type] :
( ( same_block(X4,X5)
<=> ( c_sort(X6,base_block(X4)) = c_sort(X6,base_block(X5)) ) )
& ( block(X0) = X6 )
& ( c_sort(X3,X2) = X5 )
& ( c_sort(X3,X1) = X4 ) )
& ( pointer(X0) = X3 ) ),
inference(rectify,[],[f44]) ).
tff(f448,plain,
~ ! [X0: c_unsorted,X1: c_unsorted] :
? [X2: c_type] :
( ? [X3: c_sorted,X4: c_sorted] :
( ( ( ~ same_block(X3,X4)
& ( c_Boolean_true = c_Boolean_true ) )
=> ( X3 != X4 ) )
& ( c_sort(X2,X1) = X4 )
& ( c_sort(X2,X0) = X3 ) )
& ( pointer(int_P) = X2 ) ),
inference(rectify,[],[f184]) ).
tff(f526,plain,
? [X0: c_unsorted,X1: c_unsorted] :
! [X2: c_type] :
( ! [X3: c_sorted,X4: c_sorted] :
( ( ( X3 = X4 )
& ~ same_block(X3,X4)
& ( c_Boolean_true = c_Boolean_true ) )
| ( c_sort(X2,X1) != X4 )
| ( c_sort(X2,X0) != X3 ) )
| ( pointer(int_P) != X2 ) ),
inference(ennf_transformation,[],[f448]) ).
tff(f527,plain,
? [X0: c_unsorted,X1: c_unsorted] :
! [X2: c_type] :
( ! [X3: c_sorted,X4: c_sorted] :
( ( ( X3 = X4 )
& ~ same_block(X3,X4)
& ( c_Boolean_true = c_Boolean_true ) )
| ( c_sort(X2,X1) != X4 )
| ( c_sort(X2,X0) != X3 ) )
| ( pointer(int_P) != X2 ) ),
inference(flattening,[],[f526]) ).
tff(f572,plain,
! [X0: c_type,X1: c_unsorted,X2: c_unsorted] :
? [X3: c_type] :
( ? [X4: c_sorted,X5: c_sorted,X6: c_type] :
( ( same_block(X4,X5)
| ( c_sort(X6,base_block(X4)) != c_sort(X6,base_block(X5)) ) )
& ( ( c_sort(X6,base_block(X4)) = c_sort(X6,base_block(X5)) )
| ~ same_block(X4,X5) )
& ( block(X0) = X6 )
& ( c_sort(X3,X2) = X5 )
& ( c_sort(X3,X1) = X4 ) )
& ( pointer(X0) = X3 ) ),
inference(nnf_transformation,[],[f311]) ).
tff(f573,plain,
! [X0: c_type,X1: c_unsorted,X2: c_unsorted] :
? [X3: c_type] :
( ? [X4: c_sorted,X5: c_sorted,X6: c_type] :
( ( same_block(X4,X5)
| ( c_sort(X6,base_block(X4)) != c_sort(X6,base_block(X5)) ) )
& ( ( c_sort(X6,base_block(X4)) = c_sort(X6,base_block(X5)) )
| ~ same_block(X4,X5) )
& ( block(X0) = X6 )
& ( c_sort(X3,X2) = X5 )
& ( c_sort(X3,X1) = X4 ) )
& ( pointer(X0) = X3 ) ),
inference(flattening,[],[f572]) ).
tff(f574,plain,
! [X0: c_type,X1: c_unsorted,X2: c_unsorted] :
( ? [X3: c_type] :
( ? [X4: c_sorted,X5: c_sorted,X6: c_type] :
( ( same_block(X4,X5)
| ( c_sort(X6,base_block(X4)) != c_sort(X6,base_block(X5)) ) )
& ( ( c_sort(X6,base_block(X4)) = c_sort(X6,base_block(X5)) )
| ~ same_block(X4,X5) )
& ( block(X0) = X6 )
& ( c_sort(X3,X2) = X5 )
& ( c_sort(X3,X1) = X4 ) )
& ( pointer(X0) = X3 ) )
=> ( ? [X6: c_type,X5: c_sorted,X4: c_sorted] :
( ( same_block(X4,X5)
| ( c_sort(X6,base_block(X4)) != c_sort(X6,base_block(X5)) ) )
& ( ( c_sort(X6,base_block(X4)) = c_sort(X6,base_block(X5)) )
| ~ same_block(X4,X5) )
& ( block(X0) = X6 )
& ( c_sort(sK12(X0,X1,X2),X2) = X5 )
& ( c_sort(sK12(X0,X1,X2),X1) = X4 ) )
& ( pointer(X0) = sK12(X0,X1,X2) ) ) ),
introduced(choice_axiom,[]) ).
tff(f575,plain,
! [X0: c_type,X1: c_unsorted,X2: c_unsorted] :
( ? [X6: c_type,X5: c_sorted,X4: c_sorted] :
( ( same_block(X4,X5)
| ( c_sort(X6,base_block(X4)) != c_sort(X6,base_block(X5)) ) )
& ( ( c_sort(X6,base_block(X4)) = c_sort(X6,base_block(X5)) )
| ~ same_block(X4,X5) )
& ( block(X0) = X6 )
& ( c_sort(sK12(X0,X1,X2),X2) = X5 )
& ( c_sort(sK12(X0,X1,X2),X1) = X4 ) )
=> ( ( same_block(sK13(X0,X1,X2),sK14(X0,X1,X2))
| ( c_sort(sK15(X0,X1,X2),base_block(sK13(X0,X1,X2))) != c_sort(sK15(X0,X1,X2),base_block(sK14(X0,X1,X2))) ) )
& ( ( c_sort(sK15(X0,X1,X2),base_block(sK13(X0,X1,X2))) = c_sort(sK15(X0,X1,X2),base_block(sK14(X0,X1,X2))) )
| ~ same_block(sK13(X0,X1,X2),sK14(X0,X1,X2)) )
& ( block(X0) = sK15(X0,X1,X2) )
& ( c_sort(sK12(X0,X1,X2),X2) = sK14(X0,X1,X2) )
& ( c_sort(sK12(X0,X1,X2),X1) = sK13(X0,X1,X2) ) ) ),
introduced(choice_axiom,[]) ).
tff(f576,plain,
! [X0: c_type,X1: c_unsorted,X2: c_unsorted] :
( ( same_block(sK13(X0,X1,X2),sK14(X0,X1,X2))
| ( c_sort(sK15(X0,X1,X2),base_block(sK13(X0,X1,X2))) != c_sort(sK15(X0,X1,X2),base_block(sK14(X0,X1,X2))) ) )
& ( ( c_sort(sK15(X0,X1,X2),base_block(sK13(X0,X1,X2))) = c_sort(sK15(X0,X1,X2),base_block(sK14(X0,X1,X2))) )
| ~ same_block(sK13(X0,X1,X2),sK14(X0,X1,X2)) )
& ( block(X0) = sK15(X0,X1,X2) )
& ( c_sort(sK12(X0,X1,X2),X2) = sK14(X0,X1,X2) )
& ( c_sort(sK12(X0,X1,X2),X1) = sK13(X0,X1,X2) )
& ( pointer(X0) = sK12(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15])],[f573,f575,f574]) ).
tff(f998,plain,
( ? [X0: c_unsorted,X1: c_unsorted] :
! [X2: c_type] :
( ! [X3: c_sorted,X4: c_sorted] :
( ( ( X3 = X4 )
& ~ same_block(X3,X4)
& ( c_Boolean_true = c_Boolean_true ) )
| ( c_sort(X2,X1) != X4 )
| ( c_sort(X2,X0) != X3 ) )
| ( pointer(int_P) != X2 ) )
=> ! [X2: c_type] :
( ! [X4: c_sorted,X3: c_sorted] :
( ( ( X3 = X4 )
& ~ same_block(X3,X4)
& ( c_Boolean_true = c_Boolean_true ) )
| ( c_sort(X2,sK318) != X4 )
| ( c_sort(X2,sK317) != X3 ) )
| ( pointer(int_P) != X2 ) ) ),
introduced(choice_axiom,[]) ).
tff(f999,plain,
! [X2: c_type] :
( ! [X3: c_sorted,X4: c_sorted] :
( ( ( X3 = X4 )
& ~ same_block(X3,X4)
& ( c_Boolean_true = c_Boolean_true ) )
| ( c_sort(X2,sK318) != X4 )
| ( c_sort(X2,sK317) != X3 ) )
| ( pointer(int_P) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK317,sK318])],[f527,f998]) ).
tff(f1082,plain,
! [X2: c_unsorted,X0: c_type,X1: c_unsorted] : ( pointer(X0) = sK12(X0,X1,X2) ),
inference(cnf_transformation,[],[f576]) ).
tff(f1083,plain,
! [X2: c_unsorted,X0: c_type,X1: c_unsorted] : ( c_sort(sK12(X0,X1,X2),X1) = sK13(X0,X1,X2) ),
inference(cnf_transformation,[],[f576]) ).
tff(f1084,plain,
! [X2: c_unsorted,X0: c_type,X1: c_unsorted] : ( c_sort(sK12(X0,X1,X2),X2) = sK14(X0,X1,X2) ),
inference(cnf_transformation,[],[f576]) ).
tff(f1085,plain,
! [X2: c_unsorted,X0: c_type,X1: c_unsorted] : ( block(X0) = sK15(X0,X1,X2) ),
inference(cnf_transformation,[],[f576]) ).
tff(f1087,plain,
! [X2: c_unsorted,X0: c_type,X1: c_unsorted] :
( same_block(sK13(X0,X1,X2),sK14(X0,X1,X2))
| ( c_sort(sK15(X0,X1,X2),base_block(sK13(X0,X1,X2))) != c_sort(sK15(X0,X1,X2),base_block(sK14(X0,X1,X2))) ) ),
inference(cnf_transformation,[],[f576]) ).
tff(f1598,plain,
! [X2: c_type,X3: c_sorted,X4: c_sorted] :
( ~ same_block(X3,X4)
| ( c_sort(X2,sK318) != X4 )
| ( c_sort(X2,sK317) != X3 )
| ( pointer(int_P) != X2 ) ),
inference(cnf_transformation,[],[f999]) ).
tff(f1599,plain,
! [X2: c_type,X3: c_sorted,X4: c_sorted] :
( ( X3 = X4 )
| ( c_sort(X2,sK318) != X4 )
| ( c_sort(X2,sK317) != X3 )
| ( pointer(int_P) != X2 ) ),
inference(cnf_transformation,[],[f999]) ).
tff(f1601,plain,
! [X2: c_unsorted,X0: c_type,X1: c_unsorted] : ( c_sort(pointer(X0),X1) = sK13(X0,X1,X2) ),
inference(definition_unfolding,[],[f1083,f1082]) ).
tff(f1602,plain,
! [X2: c_unsorted,X0: c_type,X1: c_unsorted] : ( c_sort(pointer(X0),X2) = sK14(X0,X1,X2) ),
inference(definition_unfolding,[],[f1084,f1082]) ).
tff(f1731,plain,
! [X2: c_unsorted,X0: c_type,X1: c_unsorted] :
( same_block(c_sort(pointer(X0),X1),c_sort(pointer(X0),X2))
| ( c_sort(block(X0),base_block(c_sort(pointer(X0),X1))) != c_sort(block(X0),base_block(c_sort(pointer(X0),X2))) ) ),
inference(definition_unfolding,[],[f1087,f1601,f1602,f1085,f1601,f1085,f1602]) ).
tff(f2031,plain,
! [X2: c_type,X3: c_sorted] :
( ( c_sort(X2,sK318) = X3 )
| ( c_sort(X2,sK317) != X3 )
| ( pointer(int_P) != X2 ) ),
inference(equality_resolution,[],[f1599]) ).
tff(f2032,plain,
! [X2: c_type] :
( ( c_sort(X2,sK318) = c_sort(X2,sK317) )
| ( pointer(int_P) != X2 ) ),
inference(equality_resolution,[],[f2031]) ).
tff(f2033,plain,
c_sort(pointer(int_P),sK318) = c_sort(pointer(int_P),sK317),
inference(equality_resolution,[],[f2032]) ).
tff(f2034,plain,
! [X2: c_type,X3: c_sorted] :
( ~ same_block(X3,c_sort(X2,sK318))
| ( c_sort(X2,sK317) != X3 )
| ( pointer(int_P) != X2 ) ),
inference(equality_resolution,[],[f1598]) ).
tff(f2035,plain,
! [X2: c_type] :
( ~ same_block(c_sort(X2,sK317),c_sort(X2,sK318))
| ( pointer(int_P) != X2 ) ),
inference(equality_resolution,[],[f2034]) ).
tff(f2036,plain,
~ same_block(c_sort(pointer(int_P),sK317),c_sort(pointer(int_P),sK318)),
inference(equality_resolution,[],[f2035]) ).
cnf(c_148,plain,
( c_sort(block(X0_17),base_block(c_sort(pointer(X0_17),X0_15))) != c_sort(block(X0_17),base_block(c_sort(pointer(X0_17),X1_15)))
| same_block(c_sort(pointer(X0_17),X0_15),c_sort(pointer(X0_17),X1_15)) ),
inference(cnf_transformation,[],[f1731]) ).
cnf(c_399,plain,
c_sort(pointer(int_P),sK317) = c_sort(pointer(int_P),sK318),
inference(cnf_transformation,[],[f2033]) ).
cnf(c_400,plain,
~ same_block(c_sort(pointer(int_P),sK317),c_sort(pointer(int_P),sK318)),
inference(cnf_transformation,[],[f2036]) ).
cnf(c_3174,plain,
~ same_block(c_sort(pointer(int_P),sK318),c_sort(pointer(int_P),sK318)),
inference(demodulation,[status(thm)],[c_400,c_399]) ).
cnf(c_12363,plain,
X0_13 = X0_13,
theory(equality) ).
cnf(c_18968,plain,
( c_sort(block(int_P),base_block(c_sort(pointer(int_P),sK318))) != c_sort(block(int_P),base_block(c_sort(pointer(int_P),sK318)))
| same_block(c_sort(pointer(int_P),sK318),c_sort(pointer(int_P),sK318)) ),
inference(instantiation,[status(thm)],[c_148]) ).
cnf(c_20045,plain,
c_sort(block(int_P),base_block(c_sort(pointer(int_P),sK318))) = c_sort(block(int_P),base_block(c_sort(pointer(int_P),sK318))),
inference(instantiation,[status(thm)],[c_12363]) ).
cnf(c_20046,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_20045,c_18968,c_3174]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : ARI748_1 : TPTP v8.1.2. Released v7.0.0.
% 0.08/0.10 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n012.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 29 18:34:38 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running TFA theorem proving
% 0.16/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 11.83/2.11 % SZS status Started for theBenchmark.p
% 11.83/2.11 % SZS status Unsatisfiable for theBenchmark.p
% 11.83/2.11
% 11.83/2.11 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 11.83/2.11
% 11.83/2.11 ------ iProver source info
% 11.83/2.11
% 11.83/2.11 git: date: 2023-05-31 18:12:56 +0000
% 11.83/2.11 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 11.83/2.11 git: non_committed_changes: false
% 11.83/2.11 git: last_make_outside_of_git: false
% 11.83/2.11
% 11.83/2.11 ------ Parsing...
% 11.83/2.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 11.83/2.11
% 11.83/2.11 ------ Preprocessing... sup_sim: 122 sf_s rm: 6 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 11 0s sf_e pe_s pe_e
% 11.83/2.11
% 11.83/2.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 11.83/2.11
% 11.83/2.11 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 11.83/2.11 ------ Proving...
% 11.83/2.11 ------ Problem Properties
% 11.83/2.11
% 11.83/2.11
% 11.83/2.11 clauses 332
% 11.83/2.11 conjectures 0
% 11.83/2.11 EPR 15
% 11.83/2.11 Horn 266
% 11.83/2.11 unary 126
% 11.83/2.11 binary 156
% 11.83/2.11 lits 600
% 11.83/2.11 lits eq 239
% 11.83/2.11 fd_pure 1
% 11.83/2.11 fd_pseudo 0
% 11.83/2.11 fd_cond 4
% 11.83/2.11 fd_pseudo_cond 9
% 11.83/2.11 AC symbols 3
% 11.83/2.11
% 11.83/2.11 ------ Input Options Time Limit: Unbounded
% 11.83/2.11
% 11.83/2.11
% 11.83/2.11 ------
% 11.83/2.11 Current options:
% 11.83/2.11 ------
% 11.83/2.11
% 11.83/2.11
% 11.83/2.11
% 11.83/2.11
% 11.83/2.11 ------ Proving...
% 11.83/2.11
% 11.83/2.11
% 11.83/2.11 % SZS status Unsatisfiable for theBenchmark.p
% 11.83/2.11
% 11.83/2.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 11.83/2.11
% 11.83/2.12
%------------------------------------------------------------------------------