%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : REL003+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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:30 PM UTC 2026
% Result : Theorem 3.19s 1.51s
% Output : CNFRefutation 3.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 18 unt; 0 def)
% Number of atoms : 66 ( 65 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 20 ~; 18 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 32 !; 2 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(f9,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
fof(f14,conjecture,
! [X0,X1] :
( ( join(converse(X0),converse(X1)) = converse(X1)
=> join(X0,X1) = X1 )
& ( join(X0,X1) = X1
=> join(converse(X0),converse(X1)) = converse(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( ( join(converse(X0),converse(X1)) = converse(X1)
=> join(X0,X1) = X1 )
& ( join(X0,X1) = X1
=> join(converse(X0),converse(X1)) = converse(X1) ) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
? [X0,X1] :
( ( join(converse(X0),converse(X1)) = converse(X1)
& join(X0,X1) != X1 )
| ( join(X0,X1) = X1
& converse(X1) != join(converse(X0),converse(X1)) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
( ( converse(sK1) = join(converse(sK0),converse(sK1))
& sK1 != join(sK0,sK1) )
| ( sK1 = join(sK0,sK1)
& converse(sK1) != join(converse(sK0),converse(sK1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[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(f25,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f26,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[],[f9]) ).
fof(f31,plain,
( converse(sK1) = join(converse(sK0),converse(sK1))
| sK1 = join(sK0,sK1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
( sK1 != join(sK0,sK1)
| converse(sK1) != join(converse(sK0),converse(sK1)) ),
inference(cnf_transformation,[],[f17]) ).
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_55,plain,
! [X0: $i] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f25]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : join(converse(X0),converse(X1)) = converse(join(X0,X1)),
inference(cnf_transformation,[],[f26]) ).
tcf(c_61,negated_conjecture,
( ( join(sK0,sK1) != sK1 )
| ( join(converse(sK0),converse(sK1)) != converse(sK1) ) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_62,negated_conjecture,
( ( join(sK0,sK1) = sK1 )
| ( join(converse(sK0),converse(sK1)) = converse(sK1) ) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_77,negated_conjecture,
( ( join(sK1,sK0) != sK1 )
| ( join(converse(sK1),converse(sK0)) != converse(sK1) ) ),
inference(theory_normalisation,[status(thm)],[c_61,c_50,c_49]) ).
tcf(c_78,negated_conjecture,
( ( join(sK1,sK0) = sK1 )
| ( join(converse(sK1),converse(sK0)) = converse(sK1) ) ),
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
tcf(c_79,plain,
( ( join(converse(sK1),converse(sK0)) != converse(sK1) )
| ( join(sK1,sK0) != sK1 ) ),
inference(prop_impl_just,[status(thm)],[c_77]) ).
tcf(c_80,plain,
( ( join(sK1,sK0) != sK1 )
| ( join(converse(sK1),converse(sK0)) != converse(sK1) ) ),
inference(renaming,[status(thm)],[c_79]) ).
tcf(c_81,plain,
( ( join(converse(sK1),converse(sK0)) = converse(sK1) )
| ( join(sK1,sK0) = sK1 ) ),
inference(prop_impl_just,[status(thm)],[c_78]) ).
tcf(c_82,plain,
( ( join(sK1,sK0) = sK1 )
| ( join(converse(sK1),converse(sK0)) = converse(sK1) ) ),
inference(renaming,[status(thm)],[c_81]) ).
tcf(c_136,plain,
( ( join(sK1,sK0) = sK1 )
| ( converse(join(sK1,sK0)) = converse(sK1) ) ),
inference(ac_demodulation,[status(thm)],[c_82,c_56,c_50,c_49]) ).
tcf(c_139,plain,
( ( join(sK1,sK0) != sK1 )
| ( converse(join(sK1,sK0)) != converse(sK1) ) ),
inference(ac_demodulation,[status(thm)],[c_80,c_56,c_50,c_49]) ).
tcf(c_157,plain,
! [X0: $i,X1: $i] :
( ( converse(X0) = converse(X1) )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_164,plain,
( ( converse(join(sK1,sK0)) = converse(sK1) )
| ( join(sK1,sK0) = sK1 ) ),
inference(prop_impl_just,[status(thm)],[c_136]) ).
tcf(c_165,plain,
( ( join(sK1,sK0) = sK1 )
| ( converse(join(sK1,sK0)) = converse(sK1) ) ),
inference(renaming,[status(thm)],[c_164]) ).
tcf(c_168,plain,
! [X0: $i,X1: $i] :
( ( converse(X0) = converse(X1) )
| ( X0 != X1 ) ),
inference(prop_impl_just,[status(thm)],[c_157]) ).
tcf(c_234,plain,
converse(join(sK1,sK0)) = converse(sK1),
inference(backward_subsumption_resolution,[status(thm)],[c_165,c_168]) ).
tcf(c_565,plain,
converse(join(sK1,sK0)) = converse(sK1),
inference(global_subsumption_just,[status(thm)],[c_136,c_234]) ).
tcf(c_571,plain,
join(sK1,sK0) = converse(converse(sK1)),
inference(superposition,[status(thm)],[c_565,c_55]) ).
tcf(c_612,plain,
join(sK1,sK0) = sK1,
inference(demodulation,[status(thm)],[c_571,c_55]) ).
tcf(c_870,plain,
join(sK1,sK0) != sK1,
inference(global_subsumption_just,[status(thm)],[c_139,c_139,c_234]) ).
tcf(c_872,plain,
$false,
inference(ground_joinability,[status(thm)],[c_870,c_612]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL003+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.58 % Computer : n003.cluster.edu
% 0.10/0.58 % Model : x86_64 x86_64
% 0.10/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.58 % Memory : 8046.5625MB
% 0.10/0.58 % OS : Linux 6.8.0-71-generic
% 0.10/0.58 % CPULimit : 300
% 0.10/0.58 % WCLimit : 300
% 0.10/0.58 % DateTime : Thu Sep 24 07:07:36 UTC 2026
% 0.10/0.58 % CPUTime :
% 0.10/0.58 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.62 Running first-order theorem proving
% 0.10/0.62 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.63
% 0.15/0.63 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.63
% 0.15/0.63 % Detected problem language: tptp
% 0.15/0.64 % Proving...
% 3.19/1.51 % SZS status Started for theBenchmark.p
% 3.19/1.51 % SZS status Theorem for theBenchmark.p
% 3.19/1.51
% 3.19/1.51 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.19/1.51
% 3.19/1.51 % ------ iProver source info
% 3.19/1.51
% 3.19/1.51 % git: date: 2026-07-19 20:42:38 +0200
% 3.19/1.51 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.19/1.51 % git: non_committed_changes: false
% 3.19/1.51
% 3.19/1.51 % ------ Parsing...
% 3.19/1.51 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.19/1.51
% 3.19/1.51 % ------ Preprocessing... sup_sim: 3 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.19/1.51
% 3.19/1.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.19/1.51
% 3.19/1.51 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.19/1.51 % ------ Proving...
% 3.19/1.51 % ------ Problem Properties
% 3.19/1.51
% 3.19/1.51 %
% 3.19/1.51 % clauses 14
% 3.19/1.51 % conjectures 0
% 3.19/1.51 % EPR 0
% 3.19/1.51 % Horn 13
% 3.19/1.51 % unary 12
% 3.19/1.51 % binary 2
% 3.19/1.51 % lits 16
% 3.19/1.51 % lits eq 16
% 3.19/1.51 % fd_pure 0
% 3.19/1.52 % fd_pseudo 0
% 3.19/1.52 % fd_cond 0
% 3.19/1.52 % fd_pseudo_cond 0
% 3.19/1.52 % AC symbols 1
% 3.19/1.52
% 3.19/1.52 % ------ Schedule dynamic 5 is on
% 3.19/1.52
% 3.19/1.52 % ------ no conjectures: strip conj schedule
% 3.19/1.52
% 3.19/1.52 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.19/1.52
% 3.19/1.52
% 3.19/1.52 % ------
% 3.19/1.52 % Current options:
% 3.19/1.52 % ------
% 3.19/1.52
% 3.19/1.52
% 3.19/1.52 %
% 3.19/1.52
% 3.19/1.52 % ------ Proving...
% 3.19/1.52 %
% 3.19/1.52
% 3.19/1.52 % SZS status Theorem for theBenchmark.p
% 3.19/1.52
% 3.19/1.52 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.19/1.52
% 3.19/1.52
%------------------------------------------------------------------------------