%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : REL008+3 : 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:33 PM UTC 2026
% Result : Theorem 133.26s 34.05s
% Output : CNFRefutation 133.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 33 ( 33 unt; 5 def)
% Number of atoms : 52 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 40 !; 3 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1,X2] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
fof(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(f9,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
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(f17,conjecture,
! [X0,X1,X2] : composition(X0,join(X1,X2)) = join(composition(X0,X1),composition(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0,X1,X2] : composition(X0,join(X1,X2)) = join(composition(X0,X1),composition(X0,X2)),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
? [X0,X1,X2] : composition(X0,join(X1,X2)) != join(composition(X0,X1),composition(X0,X2)),
inference(ennf_transformation,[],[f18]) ).
fof(f20,plain,
composition(sK0,join(sK1,sK2)) != join(composition(sK0,sK1),composition(sK0,sK2)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f19]) ).
fof(f21,plain,
composition(sK0,join(sK1,sK2)) != join(composition(sK0,sK1),composition(sK0,sK2)),
inference(cnf_transformation,[],[f20]) ).
fof(f24,plain,
! [X2,X0,X1] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
fof(f25,plain,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f31,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[],[f9]) ).
fof(f32,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
tcf(c_49,negated_conjecture,
join(composition(sK0,sK1),composition(sK0,sK2)) != composition(sK0,join(sK1,sK2)),
inference(cnf_transformation,[],[f21]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] : join(composition(X0,X1),composition(X2,X1)) = composition(join(X0,X2),X1),
inference(cnf_transformation,[],[f24]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] : composition(converse(X0),converse(X1)) = converse(composition(X1,X0)),
inference(cnf_transformation,[],[f25]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : join(converse(X0),converse(X1)) = converse(join(X0,X1)),
inference(cnf_transformation,[],[f31]) ).
tcf(c_60,plain,
! [X0: $i] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f32]) ).
tcf(c_114,definition,
iPr_def_10 = composition(sK0,sK1),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_115,definition,
iPr_def_11 = composition(sK0,sK2),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_116,definition,
iPr_def_12 = join(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_117,definition,
iPr_def_13 = join(sK1,sK2),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_118,definition,
iPr_def_14 = composition(sK0,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_119,negated_conjecture,
iPr_def_12 != iPr_def_14,
inference(demodulation,[status(thm)],[c_49,c_117,c_118,c_115,c_114,c_116]) ).
tcf(c_289436,plain,
! [X0: $i,X1: $i,X2: $i] : join(converse(composition(X0,X1)),composition(X2,converse(X0))) = composition(join(converse(X1),X2),converse(X0)),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_289679,plain,
! [X0: $i,X1: $i,X2: $i] : join(converse(composition(X0,X1)),converse(composition(X0,X2))) = composition(join(converse(X1),converse(X2)),converse(X0)),
inference(superposition,[status(thm)],[c_53,c_289436]) ).
tcf(c_301506,plain,
! [X0: $i,X1: $i,X2: $i] : converse(join(composition(X0,X1),composition(X0,X2))) = converse(composition(X0,join(X1,X2))),
inference(demodulation,[status(thm)],[c_289679,c_53,c_59]) ).
tcf(c_301516,plain,
! [X0: $i] : converse(join(iPr_def_10,composition(sK0,X0))) = converse(composition(sK0,join(sK1,X0))),
inference(superposition,[status(thm)],[c_114,c_301506]) ).
tcf(c_318616,plain,
converse(join(iPr_def_10,composition(sK0,sK2))) = converse(composition(sK0,iPr_def_13)),
inference(superposition,[status(thm)],[c_117,c_301516]) ).
tcf(c_318858,plain,
converse(iPr_def_12) = converse(iPr_def_14),
inference(light_normalisation,[status(thm)],[c_318616,c_115,c_116,c_118]) ).
tcf(c_319108,plain,
converse(converse(iPr_def_12)) = iPr_def_14,
inference(superposition,[status(thm)],[c_318858,c_60]) ).
tcf(c_319669,plain,
iPr_def_12 = iPr_def_14,
inference(demodulation,[status(thm)],[c_319108,c_60]) ).
tcf(c_319670,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_319669,c_119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL008+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.63 % Computer : n010.cluster.edu
% 0.16/0.63 % Model : x86_64 x86_64
% 0.16/0.63 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.63 % Memory : 8046.5625MB
% 0.16/0.63 % OS : Linux 6.8.0-71-generic
% 0.16/0.63 % CPULimit : 300
% 0.16/0.63 % WCLimit : 300
% 0.16/0.63 % DateTime : Thu Sep 24 07:09:12 UTC 2026
% 0.16/0.64 % CPUTime :
% 0.16/0.64 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.21/0.68 Running first-order theorem proving
% 0.21/0.68 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.21/0.69
% 0.21/0.69 % ======== iProver multi-core TPTP/SMT =========
% 0.21/0.69
% 0.21/0.69 % Detected problem language: tptp
% 0.21/0.71 % Proving...
% 133.26/34.05 % SZS status Started for theBenchmark.p
% 133.26/34.05 % SZS status Theorem for theBenchmark.p
% 133.26/34.05
% 133.26/34.05 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 133.26/34.05
% 133.26/34.05 % ------ iProver source info
% 133.26/34.05
% 133.26/34.05 % git: date: 2026-07-19 20:42:38 +0200
% 133.26/34.05 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 133.26/34.05 % git: non_committed_changes: false
% 133.26/34.05
% 133.26/34.05 % ------ Parsing...
% 133.26/34.05 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_UEQ
% 133.26/34.05 %
% 133.26/34.05
% 133.26/34.05 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 133.26/34.05
% 133.26/34.05 % ------ Preprocessing...% ------ preprocesses with Option_UEQ
% 133.26/34.05 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 133.26/34.05
% 133.26/34.05 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 133.26/34.05 % ------ Proving...
% 133.26/34.05 % ------ Problem Properties
% 133.26/34.05
% 133.26/34.05 %
% 133.26/34.05 % clauses 18
% 133.26/34.05 % conjectures 1
% 133.26/34.05 % EPR 1
% 133.26/34.05 % Horn 18
% 133.26/34.05 % unary 18
% 133.26/34.05 % binary 0
% 133.26/34.05 % lits 18
% 133.26/34.05 % lits eq 18
% 133.26/34.05 % fd_pure 0
% 133.26/34.05 % fd_pseudo 0
% 133.26/34.05 % fd_cond 0
% 133.26/34.05 % fd_pseudo_cond 0
% 133.26/34.05 % AC symbols 1
% 133.26/34.05
% 133.26/34.05 % ------ Schedule UEQ
% 133.26/34.05
% 133.26/34.05 % ------ Option_UEQ Time Limit: 10.
% 133.26/34.05
% 133.26/34.05
% 133.26/34.05 % ------
% 133.26/34.05 % Current options:
% 133.26/34.05 % ------
% 133.26/34.05
% 133.26/34.05
% 133.26/34.05 %
% 133.26/34.05
% 133.26/34.05 % ------ Proving...
% 133.26/34.05 % Proof_search_loop: time out after: 1425 full_loop iterations
% 133.26/34.05
% 133.26/34.05 % ------ Option_UEQ Time Limit: 15.
% 133.26/34.05
% 133.26/34.05
% 133.26/34.05 %
% 133.26/34.05
% 133.26/34.05 % ------ Proving...
% 133.26/34.05 % Proof_search_loop: time out after: 1873 full_loop iterations
% 133.26/34.05
% 133.26/34.05 % ------ Option_UEQ1: Age-weight queue Time Limit: 40.
% 133.26/34.05
% 133.26/34.05
% 133.26/34.05 % ------
% 133.26/34.05 % Current options:
% 133.26/34.05 % ------
% 133.26/34.05
% 133.26/34.05
% 133.26/34.05 %
% 133.26/34.05
% 133.26/34.05 % ------ Proving...
% 133.26/34.05 %
% 133.26/34.05
% 133.26/34.05 % SZS status Theorem for theBenchmark.p
% 133.26/34.05
% 133.26/34.05 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 133.26/34.05
% 133.26/34.05
%------------------------------------------------------------------------------