%------------------------------------------------------------------------------
% 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 : n003.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 : Unsatisfiable 2.11s 1.07s
% Output : CNFRefutation 2.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 47 ( 47 unt; 0 def)
% Number of atoms : 47 ( 46 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 65 !; 0 ?; 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_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(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_3) ).
fof(f4,plain,
! [X0,X1] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(reorient_equations,[],[f3]) ).
fof(f5,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_4) ).
fof(f6,plain,
! [X0,X1] : complement(join(complement(X0),complement(X1))) = meet(X0,X1),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X2,X0,X1] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_associativity_5) ).
fof(f8,axiom,
! [X0] : composition(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
fof(f10,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
fof(f12,axiom,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
fof(f13,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_11) ).
fof(f14,plain,
! [X0,X1] : complement(X1) = join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)),
inference(reorient_equations,[],[f13]) ).
fof(f15,axiom,
! [X0] : top = join(X0,complement(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_top_12) ).
fof(f16,axiom,
! [X0] : zero = meet(X0,complement(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
fof(f17,negated_conjecture,
join(zero,sk1) != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).
fof(f18,plain,
sk1 != join(zero,sk1),
inference(reorient_equations,[],[f17]) ).
fof(f19,plain,
! [X0] : zero = complement(join(complement(X0),complement(complement(X0)))),
inference(definition_unfolding,[],[f16,f6]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] : composition(composition(X0,X1),X2) = composition(X0,composition(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_67,plain,
! [X0: $i] : composition(X0,one) = X0,
inference(cnf_transformation,[],[f8]) ).
tcf(c_69,plain,
! [X0: $i] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] : composition(converse(X0),converse(X1)) = converse(composition(X1,X0)),
inference(cnf_transformation,[],[f12]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] : join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
inference(cnf_transformation,[],[f14]) ).
tcf(c_73,plain,
! [X0: $i] : join(X0,complement(X0)) = top,
inference(cnf_transformation,[],[f15]) ).
tcf(c_74,plain,
! [X0: $i] : complement(join(complement(X0),complement(complement(X0)))) = zero,
inference(cnf_transformation,[],[f19]) ).
tcf(c_75,negated_conjecture,
join(zero,sk1) != sk1,
inference(cnf_transformation,[],[f18]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i] : join(complement(join(complement(X0),X1)),complement(join(complement(X0),complement(X1)))) = X0,
inference(theory_normalisation,[status(thm)],[c_65,c_64,c_63]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i] : join(complement(X0),composition(converse(X1),complement(composition(X1,X0)))) = complement(X0),
inference(theory_normalisation,[status(thm)],[c_72,c_64,c_63]) ).
tcf(c_118,plain,
complement(top) = zero,
inference(ac_demodulation,[status(thm)],[c_74,c_73,c_64,c_63]) ).
tcf(c_209,plain,
! [X0: $i] : join(complement(join(complement(X0),complement(X0))),complement(top)) = X0,
inference(superposition,[status(thm)],[c_73,c_88]) ).
tcf(c_215,plain,
! [X0: $i] : join(complement(top),complement(join(complement(X0),complement(X0)))) = X0,
inference(theory_normalisation,[status(thm)],[c_209,c_64,c_63]) ).
tcf(c_216,plain,
! [X0: $i] : join(zero,complement(join(complement(X0),complement(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_215,c_118]) ).
tcf(c_229,plain,
! [X0: $i,X1: $i] : converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
inference(superposition,[status(thm)],[c_69,c_71]) ).
tcf(c_244,plain,
! [X0: $i,X1: $i] : composition(X0,composition(one,X1)) = composition(X0,X1),
inference(superposition,[status(thm)],[c_67,c_66]) ).
tcf(c_528,plain,
! [X0: $i] : composition(converse(one),X0) = converse(converse(X0)),
inference(superposition,[status(thm)],[c_67,c_229]) ).
tcf(c_548,plain,
! [X0: $i] : composition(converse(one),X0) = X0,
inference(light_normalisation,[status(thm)],[c_528,c_69]) ).
tcf(c_574,plain,
! [X0: $i] : join(complement(X0),complement(composition(one,X0))) = complement(X0),
inference(superposition,[status(thm)],[c_548,c_89]) ).
tcf(c_577,plain,
! [X0: $i] : composition(converse(one),X0) = composition(one,X0),
inference(superposition,[status(thm)],[c_548,c_244]) ).
tcf(c_579,plain,
! [X0: $i] : composition(one,X0) = X0,
inference(light_normalisation,[status(thm)],[c_577,c_548]) ).
tcf(c_1423,plain,
! [X0: $i] : join(complement(X0),complement(X0)) = complement(X0),
inference(light_normalisation,[status(thm)],[c_574,c_579]) ).
tcf(c_1424,plain,
! [X0: $i] : join(zero,complement(complement(X0))) = X0,
inference(demodulation,[status(thm)],[c_216,c_1423]) ).
tcf(c_1426,plain,
join(zero,zero) = zero,
inference(superposition,[status(thm)],[c_118,c_1423]) ).
tcf(c_1458,plain,
! [X0: $i] : join(zero,join(zero,X0)) = join(zero,X0),
inference(superposition,[status(thm)],[c_1426,c_64]) ).
tcf(c_1655,plain,
! [X0: $i] : join(zero,X0) = X0,
inference(superposition,[status(thm)],[c_1424,c_1458]) ).
tcf(c_1658,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_75,c_1655]) ).
%------------------------------------------------------------------------------
%----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.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 07:07:36 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.39 Running UEQ theorem proving
% 0.09/0.39 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.40
% 0.09/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.40
% 0.09/0.40 % Detected problem language: tptp
% 0.09/0.41 % Proving...
% 2.11/1.07 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.11/1.07 % SZS status Started for theBenchmark.p
% 2.11/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 2.11/1.07
% 2.11/1.07 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.11/1.07
% 2.11/1.07 % ------ iProver source info
% 2.11/1.07
% 2.11/1.07 % git: date: 2026-07-19 20:42:38 +0200
% 2.11/1.07 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.11/1.07 % git: non_committed_changes: false
% 2.11/1.07
% 2.11/1.07 % ------ Parsing...% successful
% 2.11/1.07
% 2.11/1.07
% 2.11/1.07 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.11/1.07
% 2.11/1.07 % ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.11/1.07
% 2.11/1.07 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.11/1.07
% 2.11/1.07 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.11/1.07 % ------ Proving...
% 2.11/1.07 % ------ Problem Properties
% 2.11/1.07
% 2.11/1.07 %
% 2.11/1.07 % clauses 13
% 2.11/1.07 % conjectures 1
% 2.11/1.07 % EPR 0
% 2.11/1.07 % Horn 13
% 2.11/1.07 % unary 13
% 2.11/1.07 % binary 0
% 2.11/1.07 % lits 13
% 2.11/1.07 % lits eq 13
% 2.11/1.07 % fd_pure 0
% 2.11/1.07 % fd_pseudo 0
% 2.11/1.07 % fd_cond 0
% 2.11/1.07 % fd_pseudo_cond 0
% 2.11/1.07 % AC symbols 1
% 2.11/1.07
% 2.11/1.07 % ------ Input Options Time Limit: Unbounded
% 2.11/1.07
% 2.11/1.07
% 2.11/1.07 % ------
% 2.11/1.07 % Current options:
% 2.11/1.07 % ------
% 2.11/1.07
% 2.11/1.07
% 2.11/1.07 %
% 2.11/1.07
% 2.11/1.07 % ------ Proving...
% 2.11/1.07 %
% 2.11/1.07
% 2.11/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 2.11/1.07
% 2.11/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.11/1.07
% 2.11/1.07
%------------------------------------------------------------------------------