↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : REL003-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 02:36:30 PM UTC 2026

% Result   : Unsatisfiable 3.03s 1.33s
% Output   : CNFRefutation 3.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   32 (  14 unt;   0 def)
%            Number of atoms       :   50 (  49 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   35 (  17   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn  20   !;   0   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).

fof(f2,axiom,
    ! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).

fof(f10,axiom,
    ! [X0] : converse(converse(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).

fof(f11,axiom,
    ! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).

fof(f17,negated_conjecture,
    ( join(converse(sk1),converse(sk2)) = converse(sk2)
    | join(sk1,sk2) = sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).

fof(f18,plain,
    ( converse(sk2) = join(converse(sk1),converse(sk2))
    | sk2 = join(sk1,sk2) ),
    inference(reorient_equations,[],[f17]) ).

fof(f19,negated_conjecture,
    ( join(converse(sk1),converse(sk2)) != converse(sk2)
    | join(sk1,sk2) != sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17) ).

fof(f20,plain,
    ( converse(sk2) != join(converse(sk1),converse(sk2))
    | sk2 != join(sk1,sk2) ),
    inference(reorient_equations,[],[f19]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i] : join(X0,X1) = join(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_65,plain,
    ! [X0: $i,X1: $i,X2: $i] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_70,plain,
    ! [X0: $i] : converse(converse(X0)) = X0,
    inference(cnf_transformation,[],[f10]) ).

tcf(c_71,plain,
    ! [X0: $i,X1: $i] : join(converse(X0),converse(X1)) = converse(join(X0,X1)),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_76,negated_conjecture,
    ( ( join(sk1,sk2) = sk2 )
    | ( join(converse(sk1),converse(sk2)) = converse(sk2) ) ),
    inference(cnf_transformation,[],[f18]) ).

tcf(c_77,negated_conjecture,
    ( ( join(sk1,sk2) != sk2 )
    | ( join(converse(sk1),converse(sk2)) != converse(sk2) ) ),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_90,negated_conjecture,
    ( ( join(sk2,sk1) = sk2 )
    | ( join(converse(sk2),converse(sk1)) = converse(sk2) ) ),
    inference(theory_normalisation,[status(thm)],[c_76,c_65,c_64]) ).

tcf(c_91,negated_conjecture,
    ( ( join(sk2,sk1) != sk2 )
    | ( join(converse(sk2),converse(sk1)) != converse(sk2) ) ),
    inference(theory_normalisation,[status(thm)],[c_77,c_65,c_64]) ).

tcf(c_94,plain,
    ( ( join(converse(sk2),converse(sk1)) != converse(sk2) )
    | ( join(sk2,sk1) != sk2 ) ),
    inference(prop_impl_just,[status(thm)],[c_91]) ).

tcf(c_95,plain,
    ( ( join(sk2,sk1) != sk2 )
    | ( join(converse(sk2),converse(sk1)) != converse(sk2) ) ),
    inference(renaming,[status(thm)],[c_94]) ).

tcf(c_96,plain,
    ( ( join(converse(sk2),converse(sk1)) = converse(sk2) )
    | ( join(sk2,sk1) = sk2 ) ),
    inference(prop_impl_just,[status(thm)],[c_90]) ).

tcf(c_97,plain,
    ( ( join(sk2,sk1) = sk2 )
    | ( join(converse(sk2),converse(sk1)) = converse(sk2) ) ),
    inference(renaming,[status(thm)],[c_96]) ).

tcf(c_151,plain,
    ( ( join(sk2,sk1) = sk2 )
    | ( converse(join(sk2,sk1)) = converse(sk2) ) ),
    inference(ac_demodulation,[status(thm)],[c_97,c_71,c_65,c_64]) ).

tcf(c_154,plain,
    ( ( join(sk2,sk1) != sk2 )
    | ( converse(join(sk2,sk1)) != converse(sk2) ) ),
    inference(ac_demodulation,[status(thm)],[c_95,c_71,c_65,c_64]) ).

tcf(c_170,plain,
    ! [X0: $i,X1: $i] :
      ( ( converse(X0) = converse(X1) )
      | ( X0 != X1 ) ),
    theory(equality) ).

tcf(c_179,plain,
    ( ( converse(join(sk2,sk1)) = converse(sk2) )
    | ( join(sk2,sk1) = sk2 ) ),
    inference(prop_impl_just,[status(thm)],[c_151]) ).

tcf(c_180,plain,
    ( ( join(sk2,sk1) = sk2 )
    | ( converse(join(sk2,sk1)) = converse(sk2) ) ),
    inference(renaming,[status(thm)],[c_179]) ).

tcf(c_181,plain,
    ! [X0: $i,X1: $i] :
      ( ( converse(X0) = converse(X1) )
      | ( X0 != X1 ) ),
    inference(prop_impl_just,[status(thm)],[c_170]) ).

tcf(c_245,plain,
    converse(join(sk2,sk1)) = converse(sk2),
    inference(backward_subsumption_resolution,[status(thm)],[c_180,c_181]) ).

tcf(c_580,plain,
    converse(join(sk2,sk1)) = converse(sk2),
    inference(global_subsumption_just,[status(thm)],[c_151,c_245]) ).

tcf(c_586,plain,
    join(sk2,sk1) = converse(converse(sk2)),
    inference(superposition,[status(thm)],[c_580,c_70]) ).

tcf(c_627,plain,
    join(sk2,sk1) = sk2,
    inference(demodulation,[status(thm)],[c_586,c_70]) ).

tcf(c_884,plain,
    join(sk2,sk1) != sk2,
    inference(global_subsumption_just,[status(thm)],[c_154,c_154,c_245]) ).

tcf(c_886,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_884,c_627]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : REL003-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.36  % Computer : n017.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Thu Sep 24 07:01:16 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/0.42  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.43  
% 0.13/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43  
% 0.13/0.44  % Detected problem language: tptp
% 0.13/0.45  % Proving...
% 3.03/1.33  % SZS status Started for theBenchmark.p
% 3.03/1.33  % SZS status Unsatisfiable for theBenchmark.p
% 3.03/1.33  
% 3.03/1.33  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.03/1.33  
% 3.03/1.33  % ------  iProver source info
% 3.03/1.33  
% 3.03/1.33  % git: date: 2026-07-19 20:42:38 +0200
% 3.03/1.33  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.03/1.33  % git: non_committed_changes: false
% 3.03/1.33  
% 3.03/1.33  % ------ Parsing...% successful
% 3.03/1.33  
% 3.03/1.33  
% 3.03/1.33  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.03/1.33  
% 3.03/1.33  % ------ Preprocessing... sup_sim: 3  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 3.03/1.33  
% 3.03/1.33  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.03/1.33  
% 3.03/1.33  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.03/1.33  % ------ Proving...
% 3.03/1.33  % ------ Problem Properties 
% 3.03/1.33  
% 3.03/1.33  % 
% 3.03/1.33  % clauses                               14
% 3.03/1.33  % conjectures                           0
% 3.03/1.33  % EPR                                   0
% 3.03/1.33  % Horn                                  13
% 3.03/1.33  % unary                                 12
% 3.03/1.33  % binary                                2
% 3.03/1.33  % lits                                  16
% 3.03/1.33  % lits eq                               16
% 3.03/1.33  % fd_pure                               0
% 3.03/1.33  % fd_pseudo                             0
% 3.03/1.33  % fd_cond                               0
% 3.03/1.33  % fd_pseudo_cond                        0
% 3.03/1.33  % AC symbols                            1
% 3.03/1.33  
% 3.03/1.33  % ------ Schedule dynamic 5 is on 
% 3.03/1.33  
% 3.03/1.33  % ------ no conjectures: strip conj schedule 
% 3.03/1.33  
% 3.03/1.33  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.03/1.33  
% 3.03/1.33  
% 3.03/1.33  % ------ 
% 3.03/1.33  % Current options:
% 3.03/1.33  % ------ 
% 3.03/1.33  
% 3.03/1.33  
% 3.03/1.33  % 
% 3.03/1.33  
% 3.03/1.33  % ------ Proving...
% 3.03/1.33  % 
% 3.03/1.33  
% 3.03/1.33  % SZS status Unsatisfiable for theBenchmark.p
% 3.03/1.33  
% 3.03/1.33  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.03/1.33  
% 3.03/1.33  
%------------------------------------------------------------------------------