TSTP Solution File: ITP386_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ITP386_1 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:30:46 EDT 2024
% Result : Theorem 53.80s 8.20s
% Output : CNFRefutation 53.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 205 ( 30 equ)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 90 ( 45 ~; 31 |; 10 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 120 ( 120 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 24 ( 22 usr; 9 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 71 ( 0 sgn 35 !; 14 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
tff(f73,conjecture,
'thesis$',
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture72) ).
tff(f74,negated_conjecture,
~ 'thesis$',
inference(negated_conjecture,[],[f73]) ).
tff(f75,axiom,
! [X0: 'B_c_c_fun_fun$',X1: 'C_b_fun$'] :
( ( 'valid_getter_setter$'(X1,X0)
& ! [X2: 'B_b_option_fun$',X3: 'C$'] : ( 'fun_app$j'('fun_app$am'('g$',X2),X3) = 'fun_app$an'('case_option$c'('none$','uu$'(X0,X3)),'fun_app$g'(X2,'fun_app$m'(X1,X3))) ) )
=> 'thesis$' ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hypothesis73) ).
tff(f77,axiom,
'register$a'('g$'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom75) ).
tff(f96,axiom,
! [X0: 'C_b_fun$',X1: 'B_c_c_fun_fun$',X2: 'B_b_option_fun$',X3: 'C$'] : ( 'fun_app$j'('fun_app$am'('register_from_getter_setter$a'(X0,X1),X2),X3) = 'fun_app$an'('case_option$c'('none$','uu$'(X1,X3)),'fun_app$g'(X2,'fun_app$m'(X0,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom94) ).
tff(f138,axiom,
! [X0: 'B_b_option_fun_c_c_option_fun_fun$'] :
( 'register$a'(X0)
<=> ? [X1: 'C_b_fun$',X2: 'B_c_c_fun_fun$'] :
( 'valid_getter_setter$'(X1,X2)
& ( 'register_from_getter_setter$a'(X1,X2) = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom136) ).
tff(f750,plain,
~ 'thesis$',
inference(flattening,[],[f74]) ).
tff(f861,plain,
! [X0: 'B_c_c_fun_fun$',X1: 'C_b_fun$'] :
( 'thesis$'
| ~ 'valid_getter_setter$'(X1,X0)
| ? [X2: 'B_b_option_fun$',X3: 'C$'] : ( 'fun_app$j'('fun_app$am'('g$',X2),X3) != 'fun_app$an'('case_option$c'('none$','uu$'(X0,X3)),'fun_app$g'(X2,'fun_app$m'(X1,X3))) ) ),
inference(ennf_transformation,[],[f75]) ).
tff(f862,plain,
! [X0: 'B_c_c_fun_fun$',X1: 'C_b_fun$'] :
( 'thesis$'
| ~ 'valid_getter_setter$'(X1,X0)
| ? [X2: 'B_b_option_fun$',X3: 'C$'] : ( 'fun_app$j'('fun_app$am'('g$',X2),X3) != 'fun_app$an'('case_option$c'('none$','uu$'(X0,X3)),'fun_app$g'(X2,'fun_app$m'(X1,X3))) ) ),
inference(flattening,[],[f861]) ).
tff(f1136,plain,
! [X0: 'B_c_c_fun_fun$',X1: 'C_b_fun$'] :
( ? [X2: 'B_b_option_fun$',X3: 'C$'] : ( 'fun_app$j'('fun_app$am'('g$',X2),X3) != 'fun_app$an'('case_option$c'('none$','uu$'(X0,X3)),'fun_app$g'(X2,'fun_app$m'(X1,X3))) )
=> ( 'fun_app$j'('fun_app$am'('g$',sK9(X0,X1)),sK10(X0,X1)) != 'fun_app$an'('case_option$c'('none$','uu$'(X0,sK10(X0,X1))),'fun_app$g'(sK9(X0,X1),'fun_app$m'(X1,sK10(X0,X1)))) ) ),
introduced(choice_axiom,[]) ).
tff(f1137,plain,
! [X0: 'B_c_c_fun_fun$',X1: 'C_b_fun$'] :
( 'thesis$'
| ~ 'valid_getter_setter$'(X1,X0)
| ( 'fun_app$j'('fun_app$am'('g$',sK9(X0,X1)),sK10(X0,X1)) != 'fun_app$an'('case_option$c'('none$','uu$'(X0,sK10(X0,X1))),'fun_app$g'(sK9(X0,X1),'fun_app$m'(X1,sK10(X0,X1)))) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f862,f1136]) ).
tff(f1229,plain,
! [X0: 'B_b_option_fun_c_c_option_fun_fun$'] :
( ( 'register$a'(X0)
| ! [X1: 'C_b_fun$',X2: 'B_c_c_fun_fun$'] :
( ~ 'valid_getter_setter$'(X1,X2)
| ( 'register_from_getter_setter$a'(X1,X2) != X0 ) ) )
& ( ? [X1: 'C_b_fun$',X2: 'B_c_c_fun_fun$'] :
( 'valid_getter_setter$'(X1,X2)
& ( 'register_from_getter_setter$a'(X1,X2) = X0 ) )
| ~ 'register$a'(X0) ) ),
inference(nnf_transformation,[],[f138]) ).
tff(f1230,plain,
! [X0: 'B_b_option_fun_c_c_option_fun_fun$'] :
( ( 'register$a'(X0)
| ! [X1: 'C_b_fun$',X2: 'B_c_c_fun_fun$'] :
( ~ 'valid_getter_setter$'(X1,X2)
| ( 'register_from_getter_setter$a'(X1,X2) != X0 ) ) )
& ( ? [X3: 'C_b_fun$',X4: 'B_c_c_fun_fun$'] :
( 'valid_getter_setter$'(X3,X4)
& ( 'register_from_getter_setter$a'(X3,X4) = X0 ) )
| ~ 'register$a'(X0) ) ),
inference(rectify,[],[f1229]) ).
tff(f1231,plain,
! [X0: 'B_b_option_fun_c_c_option_fun_fun$'] :
( ? [X3: 'C_b_fun$',X4: 'B_c_c_fun_fun$'] :
( 'valid_getter_setter$'(X3,X4)
& ( 'register_from_getter_setter$a'(X3,X4) = X0 ) )
=> ( 'valid_getter_setter$'(sK47(X0),sK48(X0))
& ( 'register_from_getter_setter$a'(sK47(X0),sK48(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f1232,plain,
! [X0: 'B_b_option_fun_c_c_option_fun_fun$'] :
( ( 'register$a'(X0)
| ! [X1: 'C_b_fun$',X2: 'B_c_c_fun_fun$'] :
( ~ 'valid_getter_setter$'(X1,X2)
| ( 'register_from_getter_setter$a'(X1,X2) != X0 ) ) )
& ( ( 'valid_getter_setter$'(sK47(X0),sK48(X0))
& ( 'register_from_getter_setter$a'(sK47(X0),sK48(X0)) = X0 ) )
| ~ 'register$a'(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48])],[f1230,f1231]) ).
tff(f1888,plain,
~ 'thesis$',
inference(cnf_transformation,[],[f750]) ).
tff(f1889,plain,
! [X0: 'B_c_c_fun_fun$',X1: 'C_b_fun$'] :
( 'thesis$'
| ~ 'valid_getter_setter$'(X1,X0)
| ( 'fun_app$j'('fun_app$am'('g$',sK9(X0,X1)),sK10(X0,X1)) != 'fun_app$an'('case_option$c'('none$','uu$'(X0,sK10(X0,X1))),'fun_app$g'(sK9(X0,X1),'fun_app$m'(X1,sK10(X0,X1)))) ) ),
inference(cnf_transformation,[],[f1137]) ).
tff(f1891,plain,
'register$a'('g$'),
inference(cnf_transformation,[],[f77]) ).
tff(f1917,plain,
! [X2: 'B_b_option_fun$',X3: 'C$',X0: 'C_b_fun$',X1: 'B_c_c_fun_fun$'] : ( 'fun_app$j'('fun_app$am'('register_from_getter_setter$a'(X0,X1),X2),X3) = 'fun_app$an'('case_option$c'('none$','uu$'(X1,X3)),'fun_app$g'(X2,'fun_app$m'(X0,X3))) ),
inference(cnf_transformation,[],[f96]) ).
tff(f1991,plain,
! [X0: 'B_b_option_fun_c_c_option_fun_fun$'] :
( ( 'register_from_getter_setter$a'(sK47(X0),sK48(X0)) = X0 )
| ~ 'register$a'(X0) ),
inference(cnf_transformation,[],[f1232]) ).
tff(f1992,plain,
! [X0: 'B_b_option_fun_c_c_option_fun_fun$'] :
( 'valid_getter_setter$'(sK47(X0),sK48(X0))
| ~ 'register$a'(X0) ),
inference(cnf_transformation,[],[f1232]) ).
cnf(c_140,negated_conjecture,
~ 'thesis$',
inference(cnf_transformation,[],[f1888]) ).
cnf(c_141,plain,
( 'fun_app$an'('case_option$c'('none$','uu$'(X0_66,sK10(X0_66,X0_49))),'fun_app$g'(sK9(X0_66,X0_49),'fun_app$m'(X0_49,sK10(X0_66,X0_49)))) != 'fun_app$j'('fun_app$am'('g$',sK9(X0_66,X0_49)),sK10(X0_66,X0_49))
| ~ 'valid_getter_setter$'(X0_49,X0_66)
| 'thesis$' ),
inference(cnf_transformation,[],[f1889]) ).
cnf(c_143,plain,
'register$a'('g$'),
inference(cnf_transformation,[],[f1891]) ).
cnf(c_169,plain,
'fun_app$an'('case_option$c'('none$','uu$'(X0_66,X0_44)),'fun_app$g'(X0_84,'fun_app$m'(X0_49,X0_44))) = 'fun_app$j'('fun_app$am'('register_from_getter_setter$a'(X0_49,X0_66),X0_84),X0_44),
inference(cnf_transformation,[],[f1917]) ).
cnf(c_241,plain,
( ~ 'register$a'(X0_63)
| 'valid_getter_setter$'(sK47(X0_63),sK48(X0_63)) ),
inference(cnf_transformation,[],[f1992]) ).
cnf(c_242,plain,
( ~ 'register$a'(X0_63)
| 'register_from_getter_setter$a'(sK47(X0_63),sK48(X0_63)) = X0_63 ),
inference(cnf_transformation,[],[f1991]) ).
cnf(c_2228,plain,
( ~ 'valid_getter_setter$'(X0_49,X0_66)
| 'fun_app$an'('case_option$c'('none$','uu$'(X0_66,sK10(X0_66,X0_49))),'fun_app$g'(sK9(X0_66,X0_49),'fun_app$m'(X0_49,sK10(X0_66,X0_49)))) != 'fun_app$j'('fun_app$am'('g$',sK9(X0_66,X0_49)),sK10(X0_66,X0_49)) ),
inference(prop_impl_just,[status(thm)],[c_140,c_141]) ).
cnf(c_2229,plain,
( 'fun_app$an'('case_option$c'('none$','uu$'(X0_66,sK10(X0_66,X0_49))),'fun_app$g'(sK9(X0_66,X0_49),'fun_app$m'(X0_49,sK10(X0_66,X0_49)))) != 'fun_app$j'('fun_app$am'('g$',sK9(X0_66,X0_49)),sK10(X0_66,X0_49))
| ~ 'valid_getter_setter$'(X0_49,X0_66) ),
inference(renaming,[status(thm)],[c_2228]) ).
cnf(c_10134,plain,
( 'fun_app$j'('fun_app$am'('register_from_getter_setter$a'(X0_49,X0_66),sK9(X0_66,X0_49)),sK10(X0_66,X0_49)) != 'fun_app$j'('fun_app$am'('g$',sK9(X0_66,X0_49)),sK10(X0_66,X0_49))
| ~ 'valid_getter_setter$'(X0_49,X0_66) ),
inference(demodulation,[status(thm)],[c_2229,c_169]) ).
cnf(c_15420,plain,
( ~ 'valid_getter_setter$'(X0_49,X0_66)
| 'fun_app$j'('fun_app$am'('register_from_getter_setter$a'(X0_49,X0_66),sK9(X0_66,X0_49)),sK10(X0_66,X0_49)) != 'fun_app$j'('fun_app$am'('g$',sK9(X0_66,X0_49)),sK10(X0_66,X0_49)) ),
inference(prop_impl_just,[status(thm)],[c_10134]) ).
cnf(c_15421,plain,
( 'fun_app$j'('fun_app$am'('register_from_getter_setter$a'(X0_49,X0_66),sK9(X0_66,X0_49)),sK10(X0_66,X0_49)) != 'fun_app$j'('fun_app$am'('g$',sK9(X0_66,X0_49)),sK10(X0_66,X0_49))
| ~ 'valid_getter_setter$'(X0_49,X0_66) ),
inference(renaming,[status(thm)],[c_15420]) ).
cnf(c_27237,plain,
( 'fun_app$j'('fun_app$am'('register_from_getter_setter$a'(X0_49,X0_66),sK9(X0_66,X0_49)),sK10(X0_66,X0_49)) != 'fun_app$j'('fun_app$am'('g$',sK9(X0_66,X0_49)),sK10(X0_66,X0_49))
| ~ 'valid_getter_setter$'(X0_49,X0_66) ),
inference(subtyping,[status(esa)],[c_15421]) ).
cnf(c_27982,plain,
( ~ 'register$a'(X0_63)
| 'register_from_getter_setter$a'(sK47(X0_63),sK48(X0_63)) = X0_63 ),
inference(subtyping,[status(esa)],[c_242]) ).
cnf(c_27983,plain,
( ~ 'register$a'(X0_63)
| 'valid_getter_setter$'(sK47(X0_63),sK48(X0_63)) ),
inference(subtyping,[status(esa)],[c_241]) ).
cnf(c_28066,plain,
'register$a'('g$'),
inference(subtyping,[status(esa)],[c_143]) ).
cnf(c_53675,plain,
'register_from_getter_setter$a'(sK47('g$'),sK48('g$')) = 'g$',
inference(superposition,[status(thm)],[c_28066,c_27982]) ).
cnf(c_54195,plain,
~ 'valid_getter_setter$'(sK47('g$'),sK48('g$')),
inference(superposition,[status(thm)],[c_53675,c_27237]) ).
cnf(c_54196,plain,
~ 'register$a'('g$'),
inference(superposition,[status(thm)],[c_27983,c_54195]) ).
cnf(c_54197,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_54196,c_28066]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP386_1 : TPTP v8.1.2. Released v8.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n029.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 22:08:07 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 53.80/8.20 % SZS status Started for theBenchmark.p
% 53.80/8.20 % SZS status Theorem for theBenchmark.p
% 53.80/8.20
% 53.80/8.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 53.80/8.20
% 53.80/8.20 ------ iProver source info
% 53.80/8.20
% 53.80/8.20 git: date: 2024-05-02 19:28:25 +0000
% 53.80/8.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 53.80/8.20 git: non_committed_changes: false
% 53.80/8.20
% 53.80/8.20 ------ Parsing...
% 53.80/8.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 53.80/8.20
% 53.80/8.20 ------ Preprocessing... sup_sim: 46 sf_s rm: 25 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 1 sf_s rm: 22 0s sf_e pe_s pe_e
% 53.80/8.20
% 53.80/8.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 53.80/8.20
% 53.80/8.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 53.80/8.20 ------ Proving...
% 53.80/8.20 ------ Problem Properties
% 53.80/8.20
% 53.80/8.20
% 53.80/8.20 clauses 932
% 53.80/8.20 conjectures 0
% 53.80/8.20 EPR 34
% 53.80/8.20 Horn 691
% 53.80/8.20 unary 313
% 53.80/8.20 binary 426
% 53.80/8.20 lits 1769
% 53.80/8.20 lits eq 997
% 53.80/8.20 fd_pure 1
% 53.80/8.20 fd_pseudo 0
% 53.80/8.20 fd_cond 102
% 53.80/8.20 fd_pseudo_cond 44
% 53.80/8.20 AC symbols 0
% 53.80/8.20
% 53.80/8.20 ------ Input Options Time Limit: Unbounded
% 53.80/8.20
% 53.80/8.20
% 53.80/8.20 ------
% 53.80/8.20 Current options:
% 53.80/8.20 ------
% 53.80/8.20
% 53.80/8.20
% 53.80/8.20
% 53.80/8.20
% 53.80/8.20 ------ Proving...
% 53.80/8.20
% 53.80/8.20
% 53.80/8.20 % SZS status Theorem for theBenchmark.p
% 53.80/8.20
% 53.80/8.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 53.80/8.20
% 53.80/8.20
%------------------------------------------------------------------------------