TSTP Solution File: ITP383_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ITP383_1 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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 2.51s 1.17s
% Output : CNFRefutation 2.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 192 ( 11 equ)
% Maximal formula atoms : 8 ( 10 avg)
% Number of connectives : 60 ( 25 ~; 19 |; 14 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 139 ( 139 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 9 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 34 ( 1 sgn 24 !; 8 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
tff(f60,conjecture,
'fun_app$k'('register$','g$'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture59) ).
tff(f61,negated_conjecture,
~ 'fun_app$k'('register$','g$'),
inference(negated_conjecture,[],[f60]) ).
tff(f62,axiom,
'fun_app$j'('compatible$'('g$'),'h$'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom60) ).
tff(f117,axiom,
! [X0: 'C_update_a_update_fun$',X1: 'D_update_a_update_fun$'] :
( 'fun_app$j'('compatible$'(X0),X1)
<=> ( ! [X2: 'C_update$',X3: 'D_update$'] : ( 'fun_app$bd'('comp_update$'('fun_app$u'(X0,X2)),'fun_app$au'(X1,X3)) = 'fun_app$bd'('comp_update$'('fun_app$au'(X1,X3)),'fun_app$u'(X0,X2)) )
& 'fun_app$j'('register$e',X1)
& 'fun_app$k'('register$',X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom115) ).
tff(f701,plain,
~ 'fun_app$k'('register$','g$'),
inference(flattening,[],[f61]) ).
tff(f1329,plain,
! [X0: 'C_update_a_update_fun$',X1: 'D_update_a_update_fun$'] :
( ( 'fun_app$j'('compatible$'(X0),X1)
| ? [X2: 'C_update$',X3: 'D_update$'] : ( 'fun_app$bd'('comp_update$'('fun_app$u'(X0,X2)),'fun_app$au'(X1,X3)) != 'fun_app$bd'('comp_update$'('fun_app$au'(X1,X3)),'fun_app$u'(X0,X2)) )
| ~ 'fun_app$j'('register$e',X1)
| ~ 'fun_app$k'('register$',X0) )
& ( ( ! [X2: 'C_update$',X3: 'D_update$'] : ( 'fun_app$bd'('comp_update$'('fun_app$u'(X0,X2)),'fun_app$au'(X1,X3)) = 'fun_app$bd'('comp_update$'('fun_app$au'(X1,X3)),'fun_app$u'(X0,X2)) )
& 'fun_app$j'('register$e',X1)
& 'fun_app$k'('register$',X0) )
| ~ 'fun_app$j'('compatible$'(X0),X1) ) ),
inference(nnf_transformation,[],[f117]) ).
tff(f1330,plain,
! [X0: 'C_update_a_update_fun$',X1: 'D_update_a_update_fun$'] :
( ( 'fun_app$j'('compatible$'(X0),X1)
| ? [X2: 'C_update$',X3: 'D_update$'] : ( 'fun_app$bd'('comp_update$'('fun_app$u'(X0,X2)),'fun_app$au'(X1,X3)) != 'fun_app$bd'('comp_update$'('fun_app$au'(X1,X3)),'fun_app$u'(X0,X2)) )
| ~ 'fun_app$j'('register$e',X1)
| ~ 'fun_app$k'('register$',X0) )
& ( ( ! [X2: 'C_update$',X3: 'D_update$'] : ( 'fun_app$bd'('comp_update$'('fun_app$u'(X0,X2)),'fun_app$au'(X1,X3)) = 'fun_app$bd'('comp_update$'('fun_app$au'(X1,X3)),'fun_app$u'(X0,X2)) )
& 'fun_app$j'('register$e',X1)
& 'fun_app$k'('register$',X0) )
| ~ 'fun_app$j'('compatible$'(X0),X1) ) ),
inference(flattening,[],[f1329]) ).
tff(f1331,plain,
! [X0: 'C_update_a_update_fun$',X1: 'D_update_a_update_fun$'] :
( ( 'fun_app$j'('compatible$'(X0),X1)
| ? [X2: 'C_update$',X3: 'D_update$'] : ( 'fun_app$bd'('comp_update$'('fun_app$u'(X0,X2)),'fun_app$au'(X1,X3)) != 'fun_app$bd'('comp_update$'('fun_app$au'(X1,X3)),'fun_app$u'(X0,X2)) )
| ~ 'fun_app$j'('register$e',X1)
| ~ 'fun_app$k'('register$',X0) )
& ( ( ! [X4: 'C_update$',X5: 'D_update$'] : ( 'fun_app$bd'('comp_update$'('fun_app$u'(X0,X4)),'fun_app$au'(X1,X5)) = 'fun_app$bd'('comp_update$'('fun_app$au'(X1,X5)),'fun_app$u'(X0,X4)) )
& 'fun_app$j'('register$e',X1)
& 'fun_app$k'('register$',X0) )
| ~ 'fun_app$j'('compatible$'(X0),X1) ) ),
inference(rectify,[],[f1330]) ).
tff(f1332,plain,
! [X0: 'C_update_a_update_fun$',X1: 'D_update_a_update_fun$'] :
( ? [X2: 'C_update$',X3: 'D_update$'] : ( 'fun_app$bd'('comp_update$'('fun_app$u'(X0,X2)),'fun_app$au'(X1,X3)) != 'fun_app$bd'('comp_update$'('fun_app$au'(X1,X3)),'fun_app$u'(X0,X2)) )
=> ( 'fun_app$bd'('comp_update$'('fun_app$u'(X0,sK32(X0,X1))),'fun_app$au'(X1,sK33(X0,X1))) != 'fun_app$bd'('comp_update$'('fun_app$au'(X1,sK33(X0,X1))),'fun_app$u'(X0,sK32(X0,X1))) ) ),
introduced(choice_axiom,[]) ).
tff(f1333,plain,
! [X0: 'C_update_a_update_fun$',X1: 'D_update_a_update_fun$'] :
( ( 'fun_app$j'('compatible$'(X0),X1)
| ( 'fun_app$bd'('comp_update$'('fun_app$u'(X0,sK32(X0,X1))),'fun_app$au'(X1,sK33(X0,X1))) != 'fun_app$bd'('comp_update$'('fun_app$au'(X1,sK33(X0,X1))),'fun_app$u'(X0,sK32(X0,X1))) )
| ~ 'fun_app$j'('register$e',X1)
| ~ 'fun_app$k'('register$',X0) )
& ( ( ! [X4: 'C_update$',X5: 'D_update$'] : ( 'fun_app$bd'('comp_update$'('fun_app$u'(X0,X4)),'fun_app$au'(X1,X5)) = 'fun_app$bd'('comp_update$'('fun_app$au'(X1,X5)),'fun_app$u'(X0,X4)) )
& 'fun_app$j'('register$e',X1)
& 'fun_app$k'('register$',X0) )
| ~ 'fun_app$j'('compatible$'(X0),X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK32,sK33])],[f1331,f1332]) ).
tff(f1481,plain,
~ 'fun_app$k'('register$','g$'),
inference(cnf_transformation,[],[f701]) ).
tff(f1482,plain,
'fun_app$j'('compatible$'('g$'),'h$'),
inference(cnf_transformation,[],[f62]) ).
tff(f1547,plain,
! [X0: 'C_update_a_update_fun$',X1: 'D_update_a_update_fun$'] :
( 'fun_app$k'('register$',X0)
| ~ 'fun_app$j'('compatible$'(X0),X1) ),
inference(cnf_transformation,[],[f1333]) ).
cnf(c_125,negated_conjecture,
~ 'fun_app$k'('register$','g$'),
inference(cnf_transformation,[],[f1481]) ).
cnf(c_126,plain,
'fun_app$j'('compatible$'('g$'),'h$'),
inference(cnf_transformation,[],[f1482]) ).
cnf(c_194,plain,
( ~ 'fun_app$j'('compatible$'(X0_191),X0_106)
| 'fun_app$k'('register$',X0_191) ),
inference(cnf_transformation,[],[f1547]) ).
cnf(c_665,plain,
( ~ 'fun_app$j'('compatible$'('g$'),'h$')
| 'fun_app$k'('register$','g$') ),
inference(instantiation,[status(thm)],[c_194]) ).
cnf(c_666,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_665,c_126,c_125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP383_1 : TPTP v8.1.2. Released v8.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n016.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 22:26:15 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
% 2.51/1.17 % SZS status Started for theBenchmark.p
% 2.51/1.17 % SZS status Theorem for theBenchmark.p
% 2.51/1.17
% 2.51/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.51/1.17
% 2.51/1.17 ------ iProver source info
% 2.51/1.17
% 2.51/1.17 git: date: 2024-05-02 19:28:25 +0000
% 2.51/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.51/1.17 git: non_committed_changes: false
% 2.51/1.17
% 2.51/1.17 ------ Parsing...
% 2.51/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 2.51/1.17
% 2.51/1.17
% 2.51/1.17 ------ Preprocessing...
% 2.51/1.17
% 2.51/1.17 % SZS status Theorem for theBenchmark.p
% 2.51/1.17
% 2.51/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.51/1.17
% 2.51/1.17
%------------------------------------------------------------------------------