%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL434-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n007.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:06:37 PM UTC 2026
% Result : Unsatisfiable 1.64s 1.29s
% Output : CNFRefutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 33 ( 19 unt; 4 def)
% Number of atoms : 89 ( 11 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 33 ( 16 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 37 ( 0 sgn 37 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f2,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f3,axiom,
! [X2,X0,X1] :
( c_in(X0,c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2))
| ~ c_in(X0,X1,tc_PropLog_Opl(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OH_0) ).
fof(f4,axiom,
! [X2,X0,X1] : c_in(c_PropLog_Opl_Oop_A_N_62(X0,X0,X1),c_PropLog_Othms(X2,X1),tc_PropLog_Opl(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms__I_0) ).
fof(f5,axiom,
! [X2,X3,X0,X1] :
( c_in(c_PropLog_Opl_Oop_A_N_62(X3,X0,X2),c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2))
| ~ c_in(X0,c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__right_0) ).
fof(f6,axiom,
! [X2,X3,X0,X1] :
( X0 = X1
| c_in(X0,X2,X3)
| ~ c_in(X0,c_insert(X1,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertE_0) ).
tcf(c_55,negated_conjecture,
c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_56,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_in(X0,c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2))
| ~ c_in(X0,X1,tc_PropLog_Opl(X2)) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] : c_in(c_PropLog_Opl_Oop_A_N_62(X0,X0,X1),c_PropLog_Othms(X2,X1),tc_PropLog_Opl(X1)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(c_PropLog_Opl_Oop_A_N_62(X3,X0,X2),c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2))
| ~ c_in(X0,c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( c_in(X0,X2,X3)
| ( X0 = X1 )
| ~ c_in(X0,c_insert(X1,X2,X3),X3) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_104,definition,
iPr_def_10 = c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_105,definition,
iPr_def_11 = c_PropLog_Othms(v_H,t_a),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_106,definition,
iPr_def_12 = tc_PropLog_Opl(t_a),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_107,definition,
iPr_def_13 = c_insert(v_p,v_H,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_108,negated_conjecture,
~ c_in(iPr_def_10,iPr_def_11,iPr_def_12),
inference(demodulation,[status(thm)],[c_56,c_106,c_105,c_104]) ).
tcf(c_109,negated_conjecture,
c_in(v_pa,iPr_def_13,iPr_def_12),
inference(demodulation,[status(thm)],[c_55,c_107]) ).
tcf(c_270,plain,
! [X0: $i] : c_in(c_PropLog_Opl_Oop_A_N_62(X0,X0,t_a),iPr_def_11,tc_PropLog_Opl(t_a)),
inference(superposition,[status(thm)],[c_105,c_58]) ).
tcf(c_272,plain,
! [X0: $i] : c_in(c_PropLog_Opl_Oop_A_N_62(X0,X0,t_a),iPr_def_11,iPr_def_12),
inference(light_normalisation,[status(thm)],[c_270,c_106]) ).
tcf(c_278,plain,
! [X0: $i] :
( c_in(X0,iPr_def_11,tc_PropLog_Opl(t_a))
| ~ c_in(X0,v_H,tc_PropLog_Opl(t_a)) ),
inference(superposition,[status(thm)],[c_105,c_57]) ).
tcf(c_280,plain,
! [X0: $i] :
( c_in(X0,iPr_def_11,iPr_def_12)
| ~ c_in(X0,v_H,iPr_def_12) ),
inference(light_normalisation,[status(thm)],[c_278,c_106]) ).
tcf(c_294,plain,
! [X0: $i] :
( c_in(X0,v_H,iPr_def_12)
| ( X0 = v_p )
| ~ c_in(X0,iPr_def_13,iPr_def_12) ),
inference(superposition,[status(thm)],[c_107,c_60]) ).
tcf(c_304,plain,
! [X0: $i,X1: $i] :
( c_in(c_PropLog_Opl_Oop_A_N_62(X1,X0,t_a),iPr_def_11,tc_PropLog_Opl(t_a))
| ~ c_in(X0,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ),
inference(superposition,[status(thm)],[c_105,c_59]) ).
tcf(c_309,plain,
! [X0: $i,X1: $i] :
( c_in(c_PropLog_Opl_Oop_A_N_62(X1,X0,t_a),iPr_def_11,iPr_def_12)
| ~ c_in(X0,iPr_def_11,iPr_def_12) ),
inference(light_normalisation,[status(thm)],[c_304,c_105,c_106]) ).
tcf(c_329,plain,
( c_in(iPr_def_10,iPr_def_11,iPr_def_12)
| ~ c_in(v_pa,iPr_def_11,iPr_def_12) ),
inference(superposition,[status(thm)],[c_104,c_309]) ).
tcf(c_330,plain,
~ c_in(v_pa,iPr_def_11,iPr_def_12),
inference(forward_subsumption_resolution,[status(thm)],[c_329,c_108]) ).
tcf(c_337,plain,
( c_in(v_pa,v_H,iPr_def_12)
| ( v_pa = v_p ) ),
inference(superposition,[status(thm)],[c_109,c_294]) ).
tcf(c_344,plain,
( c_in(v_pa,iPr_def_11,iPr_def_12)
| ( v_pa = v_p ) ),
inference(superposition,[status(thm)],[c_337,c_280]) ).
tcf(c_345,plain,
v_pa = v_p,
inference(forward_subsumption_resolution,[status(thm)],[c_344,c_330]) ).
tcf(c_348,plain,
c_PropLog_Opl_Oop_A_N_62(v_pa,v_pa,t_a) = iPr_def_10,
inference(demodulation,[status(thm)],[c_104,c_345]) ).
tcf(c_357,plain,
c_in(iPr_def_10,iPr_def_11,iPr_def_12),
inference(superposition,[status(thm)],[c_348,c_272]) ).
tcf(c_359,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_357,c_108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL434-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n007.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Wed Sep 23 23:18:52 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 1.64/1.29 % SZS status Started for theBenchmark.p
% 1.64/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.64/1.29
% 1.64/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.64/1.29
% 1.64/1.29 % ------ iProver source info
% 1.64/1.29
% 1.64/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.64/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.64/1.29 % git: non_committed_changes: false
% 1.64/1.29
% 1.64/1.29 % ------ Parsing...% successful
% 1.64/1.29
% 1.64/1.29
% 1.64/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.64/1.29
% 1.64/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.64/1.29
% 1.64/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.64/1.29
% 1.64/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.64/1.29 % ------ Proving...
% 1.64/1.29 % ------ Problem Properties
% 1.64/1.29
% 1.64/1.29 %
% 1.64/1.29 % clauses 10
% 1.64/1.29 % conjectures 2
% 1.64/1.29 % EPR 2
% 1.64/1.29 % Horn 9
% 1.64/1.29 % unary 7
% 1.64/1.29 % binary 2
% 1.64/1.29 % lits 14
% 1.64/1.29 % lits eq 5
% 1.64/1.29 % fd_pure 0
% 1.64/1.29 % fd_pseudo 0
% 1.64/1.29 % fd_cond 0
% 1.64/1.29 % fd_pseudo_cond 1
% 1.64/1.29 % AC symbols 0
% 1.64/1.29
% 1.64/1.29 % ------ Schedule dynamic 5 is on
% 1.64/1.29
% 1.64/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.64/1.29
% 1.64/1.29
% 1.64/1.29 % ------
% 1.64/1.29 % Current options:
% 1.64/1.29 % ------
% 1.64/1.29
% 1.64/1.29
% 1.64/1.29 %
% 1.64/1.29
% 1.64/1.29 % ------ Proving...
% 1.64/1.29 %
% 1.64/1.29
% 1.64/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.64/1.29
% 1.64/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.64/1.29
% 1.64/1.29
%------------------------------------------------------------------------------