%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : REL001+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 : n010.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:29 PM UTC 2026
% Result : Theorem 4.09s 1.33s
% Output : CNFRefutation 4.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 62 ( 62 unt; 1 def)
% Number of atoms : 67 ( 61 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 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 : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn 81 !; 1 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(f3,axiom,
! [X0,X1] : X0 = join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).
fof(f4,axiom,
! [X0,X1] : meet(X0,X1) = complement(join(complement(X0),complement(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(f5,axiom,
! [X0,X1,X2] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_associativity) ).
fof(f6,axiom,
! [X0] : composition(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(f10,axiom,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(f11,axiom,
! [X0,X1] : join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(f12,axiom,
! [X0] : top = join(X0,complement(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_top) ).
fof(f13,axiom,
! [X0] : zero = meet(X0,complement(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_zero) ).
fof(f14,conjecture,
! [X0] : join(zero,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0] : join(zero,X0) = X0,
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
? [X0] : join(zero,X0) != X0,
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
sK0 != join(zero,sK0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f16]) ).
fof(f18,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f19,plain,
! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
inference(cnf_transformation,[],[f2]) ).
fof(f20,plain,
! [X0,X1] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f21,plain,
! [X0,X1] : complement(join(complement(X0),complement(X1))) = meet(X0,X1),
inference(cnf_transformation,[],[f4]) ).
fof(f22,plain,
! [X2,X0,X1] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f23,plain,
! [X0] : composition(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f25,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f27,plain,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f28,plain,
! [X0,X1] : complement(X1) = join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)),
inference(cnf_transformation,[],[f11]) ).
fof(f29,plain,
! [X0] : top = join(X0,complement(X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f30,plain,
! [X0] : zero = meet(X0,complement(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f31,plain,
sK0 != join(zero,sK0),
inference(cnf_transformation,[],[f17]) ).
fof(f32,plain,
! [X0] : zero = complement(join(complement(X0),complement(complement(X0)))),
inference(definition_unfolding,[],[f30,f21]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f18]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
inference(cnf_transformation,[],[f19]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f20]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] : composition(composition(X0,X1),X2) = composition(X0,composition(X1,X2)),
inference(cnf_transformation,[],[f22]) ).
tcf(c_53,plain,
! [X0: $i] : composition(X0,one) = X0,
inference(cnf_transformation,[],[f23]) ).
tcf(c_55,plain,
! [X0: $i] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f25]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : composition(converse(X0),converse(X1)) = converse(composition(X1,X0)),
inference(cnf_transformation,[],[f27]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
inference(cnf_transformation,[],[f28]) ).
tcf(c_59,plain,
! [X0: $i] : join(X0,complement(X0)) = top,
inference(cnf_transformation,[],[f29]) ).
tcf(c_60,plain,
! [X0: $i] : complement(join(complement(X0),complement(complement(X0)))) = zero,
inference(cnf_transformation,[],[f32]) ).
tcf(c_61,negated_conjecture,
join(zero,sK0) != sK0,
inference(cnf_transformation,[],[f31]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] : join(complement(join(complement(X0),X1)),complement(join(complement(X0),complement(X1)))) = X0,
inference(theory_normalisation,[status(thm)],[c_51,c_50,c_49]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] : join(complement(X0),composition(converse(X1),complement(composition(X1,X0)))) = complement(X0),
inference(theory_normalisation,[status(thm)],[c_58,c_50,c_49]) ).
tcf(c_104,plain,
complement(top) = zero,
inference(ac_demodulation,[status(thm)],[c_60,c_59,c_50,c_49]) ).
tcf(c_111,definition,
iPr_def_10 = join(zero,sK0),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_112,negated_conjecture,
iPr_def_10 != sK0,
inference(demodulation,[status(thm)],[c_61,c_111]) ).
tcf(c_189,plain,
! [X0: $i] : join(complement(join(complement(X0),complement(X0))),complement(top)) = X0,
inference(superposition,[status(thm)],[c_59,c_74]) ).
tcf(c_195,plain,
! [X0: $i] : join(complement(top),complement(join(complement(X0),complement(X0)))) = X0,
inference(theory_normalisation,[status(thm)],[c_189,c_50,c_49]) ).
tcf(c_196,plain,
! [X0: $i] : join(zero,complement(join(complement(X0),complement(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_195,c_104]) ).
tcf(c_208,plain,
! [X0: $i,X1: $i] : converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
inference(superposition,[status(thm)],[c_55,c_57]) ).
tcf(c_217,plain,
! [X0: $i,X1: $i] : composition(X0,composition(one,X1)) = composition(X0,X1),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_379,plain,
! [X0: $i] : composition(converse(one),X0) = converse(converse(X0)),
inference(superposition,[status(thm)],[c_53,c_208]) ).
tcf(c_399,plain,
! [X0: $i] : composition(converse(one),X0) = X0,
inference(light_normalisation,[status(thm)],[c_379,c_55]) ).
tcf(c_413,plain,
! [X0: $i] : join(complement(X0),complement(composition(one,X0))) = complement(X0),
inference(superposition,[status(thm)],[c_399,c_75]) ).
tcf(c_416,plain,
! [X0: $i] : composition(converse(one),X0) = composition(one,X0),
inference(superposition,[status(thm)],[c_399,c_217]) ).
tcf(c_418,plain,
! [X0: $i] : composition(one,X0) = X0,
inference(light_normalisation,[status(thm)],[c_416,c_399]) ).
tcf(c_1080,plain,
! [X0: $i] : join(complement(X0),complement(X0)) = complement(X0),
inference(light_normalisation,[status(thm)],[c_413,c_418]) ).
tcf(c_1081,plain,
! [X0: $i] : join(zero,complement(complement(X0))) = X0,
inference(demodulation,[status(thm)],[c_196,c_1080]) ).
tcf(c_1082,plain,
join(zero,zero) = zero,
inference(superposition,[status(thm)],[c_104,c_1080]) ).
tcf(c_1116,plain,
! [X0: $i] : join(zero,join(zero,X0)) = join(zero,X0),
inference(superposition,[status(thm)],[c_1082,c_50]) ).
tcf(c_1254,plain,
! [X0: $i] : join(zero,X0) = X0,
inference(superposition,[status(thm)],[c_1081,c_1116]) ).
tcf(c_1258,plain,
sK0 = iPr_def_10,
inference(demodulation,[status(thm)],[c_111,c_1254]) ).
tcf(c_1264,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_112,c_1258]) ).
tcf(c_1265,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_1264]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL001+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.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 07:06:14 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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.15/0.45
% 0.15/0.45 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.45
% 0.15/0.46 % Detected problem language: tptp
% 0.15/0.47 % Proving...
% 4.09/1.33 % SZS status Started for theBenchmark.p
% 4.09/1.33 % SZS status Theorem for theBenchmark.p
% 4.09/1.33
% 4.09/1.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.09/1.33
% 4.09/1.33 % ------ iProver source info
% 4.09/1.33
% 4.09/1.33 % git: date: 2026-07-19 20:42:38 +0200
% 4.09/1.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.09/1.33 % git: non_committed_changes: false
% 4.09/1.33
% 4.09/1.33 % ------ Parsing...
% 4.09/1.33 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_UEQ
% 4.09/1.33 %
% 4.09/1.33
% 4.09/1.33 % ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.09/1.33
% 4.09/1.33 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 4.09/1.33 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.09/1.33
% 4.09/1.33 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 4.09/1.33 % ------ Proving...
% 4.09/1.33 % ------ Problem Properties
% 4.09/1.33
% 4.09/1.33 %
% 4.09/1.33 % clauses 14
% 4.09/1.33 % conjectures 1
% 4.09/1.33 % EPR 1
% 4.09/1.33 % Horn 14
% 4.09/1.33 % unary 14
% 4.09/1.33 % binary 0
% 4.09/1.33 % lits 14
% 4.09/1.33 % lits eq 14
% 4.09/1.33 % fd_pure 0
% 4.09/1.33 % fd_pseudo 0
% 4.09/1.33 % fd_cond 0
% 4.09/1.33 % fd_pseudo_cond 0
% 4.09/1.33 % AC symbols 1
% 4.09/1.33
% 4.09/1.33 % ------ Schedule UEQ
% 4.09/1.33
% 4.09/1.33 % ------ Option_UEQ Time Limit: 10.
% 4.09/1.33
% 4.09/1.33
% 4.09/1.33 % ------
% 4.09/1.33 % Current options:
% 4.09/1.33 % ------
% 4.09/1.33
% 4.09/1.33
% 4.09/1.33 %
% 4.09/1.33
% 4.09/1.33 % ------ Proving...
% 4.09/1.33 %
% 4.09/1.33
% 4.09/1.33 % SZS status Theorem for theBenchmark.p
% 4.09/1.33
% 4.09/1.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.09/1.33
% 4.09/1.33
%------------------------------------------------------------------------------