↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n018.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:05:47 PM UTC 2026

% Result   : Unsatisfiable 2.28s 1.27s
% Output   : CNFRefutation 2.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   46 (  46 unt;   0 def)
%            Number of atoms       :   46 (  45 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    8 (   8   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    5 (   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    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   51 (   0 sgn  51   !;   0   ?;  26   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : implies(truth,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).

fof(f2,axiom,
    ! [X2,X0,X1] : implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).

fof(f3,plain,
    ! [X2,X0,X1] : truth = implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))),
    inference(reorient_equations,[],[f2]) ).

fof(f4,axiom,
    ! [X0,X1] : implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).

fof(f5,axiom,
    ! [X0,X1] : implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).

fof(f6,plain,
    ! [X0,X1] : truth = implies(implies(not(X0),not(X1)),implies(X1,X0)),
    inference(reorient_equations,[],[f5]) ).

fof(f7,axiom,
    ! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_definition) ).

fof(f9,axiom,
    ! [X0,X1] : or(X0,X1) = or(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).

fof(f15,axiom,
    ! [X0,X1] : and_star(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',and_star_definition) ).

fof(f16,plain,
    ! [X0,X1] : not(or(not(X0),not(X1))) = and_star(X0,X1),
    inference(reorient_equations,[],[f15]) ).

fof(f19,axiom,
    not(truth) = falsehood,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',false_definition) ).

fof(f20,negated_conjecture,
    and_star(x,falsehood) != falsehood,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).

fof(f21,plain,
    falsehood != and_star(x,falsehood),
    inference(reorient_equations,[],[f20]) ).

fof(f24,plain,
    ! [X0,X1] : and_star(X0,X1) = not(implies(not(not(X0)),not(X1))),
    inference(definition_unfolding,[],[f16,f7]) ).

fof(f26,plain,
    ! [X0,X1] : implies(not(X0),X1) = implies(not(X1),X0),
    inference(definition_unfolding,[],[f9,f7,f7]) ).

fof(f32,plain,
    falsehood != not(implies(not(not(x)),not(falsehood))),
    inference(definition_unfolding,[],[f21,f24]) ).

tcf(c_66,plain,
    ! [X0: $i] : implies(truth,X0) = X0,
    inference(cnf_transformation,[],[f1]) ).

tcf(c_67,plain,
    ! [X0: $i,X1: $i,X2: $i] : implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
    inference(cnf_transformation,[],[f3]) ).

tcf(c_68,plain,
    ! [X0: $i,X1: $i] : implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_69,plain,
    ! [X0: $i,X1: $i] : implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
    inference(cnf_transformation,[],[f6]) ).

tcf(c_71,plain,
    ! [X0: $i,X1: $i] : implies(not(X0),X1) = implies(not(X1),X0),
    inference(cnf_transformation,[],[f26]) ).

tcf(c_77,plain,
    not(truth) = falsehood,
    inference(cnf_transformation,[],[f19]) ).

tcf(c_78,negated_conjecture,
    not(implies(not(not(x)),not(falsehood))) != falsehood,
    inference(cnf_transformation,[],[f32]) ).

tcf(c_110,plain,
    not(implies(not(not(falsehood)),not(x))) != falsehood,
    inference(demodulation,[status(thm)],[c_78,c_71]) ).

tcf(c_184,plain,
    ! [X0: $i] : implies(not(X0),truth) = implies(falsehood,X0),
    inference(superposition,[status(thm)],[c_77,c_71]) ).

tcf(c_196,plain,
    ! [X0: $i] : implies(implies(X0,truth),truth) = implies(X0,X0),
    inference(superposition,[status(thm)],[c_66,c_68]) ).

tcf(c_206,plain,
    ! [X0: $i] : implies(not(X0),not(X0)) = implies(implies(falsehood,X0),truth),
    inference(superposition,[status(thm)],[c_184,c_196]) ).

tcf(c_222,plain,
    ! [X0: $i] : implies(implies(not(X0),not(truth)),X0) = truth,
    inference(superposition,[status(thm)],[c_66,c_69]) ).

tcf(c_231,plain,
    ! [X0: $i] : implies(implies(not(X0),falsehood),X0) = truth,
    inference(light_normalisation,[status(thm)],[c_222,c_77]) ).

tcf(c_299,plain,
    ! [X0: $i,X1: $i] : implies(implies(truth,X0),implies(implies(X0,X1),X1)) = truth,
    inference(superposition,[status(thm)],[c_66,c_67]) ).

tcf(c_317,plain,
    ! [X0: $i,X1: $i] : implies(X0,implies(implies(X0,X1),X1)) = truth,
    inference(light_normalisation,[status(thm)],[c_299,c_66]) ).

tcf(c_666,plain,
    ! [X0: $i] : implies(implies(not(falsehood),X0),X0) = truth,
    inference(superposition,[status(thm)],[c_71,c_231]) ).

tcf(c_667,plain,
    implies(implies(falsehood,falsehood),truth) = truth,
    inference(superposition,[status(thm)],[c_77,c_231]) ).

tcf(c_763,plain,
    implies(not(falsehood),not(falsehood)) = truth,
    inference(demodulation,[status(thm)],[c_667,c_206]) ).

tcf(c_793,plain,
    implies(truth,not(falsehood)) = truth,
    inference(superposition,[status(thm)],[c_763,c_666]) ).

tcf(c_817,plain,
    not(falsehood) = truth,
    inference(demodulation,[status(thm)],[c_793,c_66]) ).

tcf(c_818,plain,
    ! [X0: $i] : implies(implies(truth,X0),X0) = truth,
    inference(demodulation,[status(thm)],[c_666,c_817]) ).

tcf(c_820,plain,
    not(implies(not(truth),not(x))) != falsehood,
    inference(demodulation,[status(thm)],[c_110,c_817]) ).

tcf(c_821,plain,
    ! [X0: $i] : implies(X0,X0) = truth,
    inference(light_normalisation,[status(thm)],[c_818,c_66]) ).

tcf(c_822,plain,
    not(implies(falsehood,not(x))) != falsehood,
    inference(light_normalisation,[status(thm)],[c_820,c_77]) ).

tcf(c_823,plain,
    ! [X0: $i] : implies(implies(X0,truth),truth) = truth,
    inference(demodulation,[status(thm)],[c_196,c_821]) ).

tcf(c_935,plain,
    ! [X0: $i] : implies(implies(falsehood,X0),truth) = truth,
    inference(superposition,[status(thm)],[c_184,c_823]) ).

tcf(c_1040,plain,
    ! [X0: $i] : implies(not(X0),implies(implies(falsehood,X0),truth)) = truth,
    inference(superposition,[status(thm)],[c_184,c_317]) ).

tcf(c_1062,plain,
    ! [X0: $i] : implies(falsehood,X0) = truth,
    inference(light_normalisation,[status(thm)],[c_1040,c_184,c_935]) ).

tcf(c_1066,plain,
    not(truth) != falsehood,
    inference(demodulation,[status(thm)],[c_822,c_1062]) ).

tcf(c_1067,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_1066,c_77]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL157-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.07/0.35  % Computer : n018.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Wed Sep 23 22:08:47 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39  Running UEQ theorem proving
% 0.12/0.39  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40  
% 0.12/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40  
% 0.12/0.40  % Detected problem language: tptp
% 0.12/0.42  % Proving...
% 2.28/1.27  WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.28/1.27  % SZS status Started for theBenchmark.p
% 2.28/1.27  % SZS status Unsatisfiable for theBenchmark.p
% 2.28/1.27  
% 2.28/1.27  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.28/1.27  
% 2.28/1.27  % ------  iProver source info
% 2.28/1.27  
% 2.28/1.27  % git: date: 2026-07-19 20:42:38 +0200
% 2.28/1.27  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.28/1.27  % git: non_committed_changes: false
% 2.28/1.27  
% 2.28/1.27  % ------ Parsing...% successful
% 2.28/1.27  
% 2.28/1.27  
% 2.28/1.27  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.28/1.27  
% 2.28/1.27  % ------ Preprocessing... sup_sim: 2  sf_s  rm: 0 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 2.28/1.27  
% 2.28/1.27  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.28/1.27  
% 2.28/1.27  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 2.28/1.27  % ------ Proving...
% 2.28/1.27  % ------ Problem Properties 
% 2.28/1.27  
% 2.28/1.27  % 
% 2.28/1.27  % clauses                               10
% 2.28/1.27  % conjectures                           0
% 2.28/1.27  % EPR                                   0
% 2.28/1.27  % Horn                                  10
% 2.28/1.27  % unary                                 10
% 2.28/1.27  % binary                                0
% 2.28/1.27  % lits                                  10
% 2.28/1.27  % lits eq                               10
% 2.28/1.27  % fd_pure                               0
% 2.28/1.27  % fd_pseudo                             0
% 2.28/1.27  % fd_cond                               0
% 2.28/1.27  % fd_pseudo_cond                        0
% 2.28/1.27  % AC symbols                            0
% 2.28/1.27  
% 2.28/1.27  % ------ Input Options Time Limit: Unbounded
% 2.28/1.27  
% 2.28/1.27  
% 2.28/1.27  % ------ 
% 2.28/1.27  % Current options:
% 2.28/1.27  % ------ 
% 2.28/1.27  
% 2.28/1.27  
% 2.28/1.27  % 
% 2.28/1.27  
% 2.28/1.27  % ------ Proving...
% 2.28/1.27  % 
% 2.28/1.27  
% 2.28/1.27  % SZS status Unsatisfiable for theBenchmark.p
% 2.28/1.27  
% 2.28/1.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.28/1.27  
% 2.28/1.27  
%------------------------------------------------------------------------------