%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : REL049+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:37:02 PM UTC 2026
% Result : Theorem 1.48s 1.18s
% Output : CNFRefutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 17 unt; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 8 ~; 0 |; 8 &)
% ( 0 <=>; 2 =>; 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 21 !; 6 ?; 5 :)
% 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(f14,conjecture,
! [X0,X1,X2] :
( ( join(X2,X1) = X1
& join(X0,X1) = X1 )
=> join(join(X0,X2),X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0,X1,X2] :
( ( join(X2,X1) = X1
& join(X0,X1) = X1 )
=> join(join(X0,X2),X1) = X1 ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
? [X0,X1,X2] :
( join(X2,X1) = X1
& join(X0,X1) = X1
& join(join(X0,X2),X1) != X1 ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
? [X0,X1,X2] :
( join(X2,X1) = X1
& join(X0,X1) = X1
& join(join(X0,X2),X1) != X1 ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
( sK1 = join(sK2,sK1)
& sK1 = join(sK0,sK1)
& sK1 != join(join(sK0,sK2),sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f17]) ).
fof(f19,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f20,plain,
! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
inference(cnf_transformation,[],[f2]) ).
fof(f32,plain,
sK1 = join(sK2,sK1),
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
sK1 = join(sK0,sK1),
inference(cnf_transformation,[],[f18]) ).
fof(f34,plain,
sK1 != join(join(sK0,sK2),sK1),
inference(cnf_transformation,[],[f18]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f19]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_61,negated_conjecture,
join(join(sK0,sK2),sK1) != sK1,
inference(cnf_transformation,[],[f34]) ).
tcf(c_62,negated_conjecture,
join(sK0,sK1) = sK1,
inference(cnf_transformation,[],[f33]) ).
tcf(c_63,negated_conjecture,
join(sK2,sK1) = sK1,
inference(cnf_transformation,[],[f32]) ).
tcf(c_78,negated_conjecture,
join(sK1,join(sK0,sK2)) != sK1,
inference(theory_normalisation,[status(thm)],[c_61,c_50,c_49]) ).
tcf(c_79,negated_conjecture,
join(sK1,sK0) = sK1,
inference(theory_normalisation,[status(thm)],[c_62,c_50,c_49]) ).
tcf(c_80,negated_conjecture,
join(sK1,sK2) = sK1,
inference(theory_normalisation,[status(thm)],[c_63,c_50,c_49]) ).
tcf(c_113,plain,
join(sK0,sK1) != sK1,
inference(ac_demodulation,[status(thm)],[c_78,c_80,c_50,c_49]) ).
tcf(c_114,plain,
$false,
inference(ac_demodulation,[status(thm)],[c_113,c_79,c_50,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL049+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.13/0.37 % Computer : n003.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Thu Sep 24 07:39:22 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.13/0.43
% 0.13/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43
% 0.13/0.43 % Detected problem language: tptp
% 0.13/0.44 % Proving...
% 1.48/1.18 % SZS status Started for theBenchmark.p
% 1.48/1.18 % SZS status Theorem for theBenchmark.p
% 1.48/1.18
% 1.48/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.48/1.18
% 1.48/1.18 % ------ iProver source info
% 1.48/1.18
% 1.48/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 1.48/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.48/1.18 % git: non_committed_changes: false
% 1.48/1.18
% 1.48/1.18 % ------ Parsing...
% 1.48/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_UEQ
% 1.48/1.18 %
% 1.48/1.18
% 1.48/1.18 % ------ Preprocessing...%
% 1.48/1.18
% 1.48/1.18 % SZS status Theorem for theBenchmark.p
% 1.48/1.18
% 1.48/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.48/1.18
% 1.48/1.18
%------------------------------------------------------------------------------