%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : REL046+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 : n020.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:01 PM UTC 2026
% Result : Theorem 3.94s 1.30s
% Output : CNFRefutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 23 unt; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 12 ~; 5 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 36 !; 3 ?; 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(f3,axiom,
! [X0,X1] : X0 = join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(f14,conjecture,
! [X0,X1,X2] :
( join(X0,meet(X1,X2)) = meet(X1,X2)
=> ( join(X0,X2) = X2
& join(X0,X1) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0,X1,X2] :
( join(X0,meet(X1,X2)) = meet(X1,X2)
=> ( join(X0,X2) = X2
& join(X0,X1) = X1 ) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
? [X0,X1,X2] :
( join(X0,meet(X1,X2)) = meet(X1,X2)
& ( join(X0,X2) != X2
| join(X0,X1) != X1 ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
( meet(sK1,sK2) = join(sK0,meet(sK1,sK2))
& ( sK2 != join(sK0,sK2)
| sK1 != join(sK0,sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f16]) ).
fof(f18,plain,
meet(sK1,sK2) = join(sK0,meet(sK1,sK2)),
inference(cnf_transformation,[],[f17]) ).
fof(f19,plain,
( sK2 != join(sK0,sK2)
| sK1 != join(sK0,sK1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f20,plain,
! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
inference(cnf_transformation,[],[f2]) ).
fof(f21,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f22,plain,
! [X0,X1] : complement(join(complement(X0),complement(X1))) = meet(X0,X1),
inference(cnf_transformation,[],[f4]) ).
fof(f24,plain,
! [X0,X1] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f30,plain,
complement(join(complement(sK1),complement(sK2))) = join(sK0,complement(join(complement(sK1),complement(sK2)))),
inference(definition_unfolding,[],[f18,f22,f22]) ).
tcf(c_49,negated_conjecture,
( ( join(sK0,sK2) != sK2 )
| ( join(sK0,sK1) != sK1 ) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_50,negated_conjecture,
join(sK0,complement(join(complement(sK1),complement(sK2)))) = complement(join(complement(sK1),complement(sK2))),
inference(cnf_transformation,[],[f30]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f21]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f24]) ).
tcf(c_69,negated_conjecture,
( ( join(sK2,sK0) != sK2 )
| ( join(sK1,sK0) != sK1 ) ),
inference(theory_normalisation,[status(thm)],[c_49,c_51,c_52]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] : join(complement(join(complement(X0),X1)),complement(join(complement(X0),complement(X1)))) = X0,
inference(theory_normalisation,[status(thm)],[c_54,c_51,c_52]) ).
tcf(c_237,plain,
! [X0: $i] : join(sK0,join(complement(join(complement(sK1),complement(sK2))),X0)) = join(complement(join(complement(sK1),complement(sK2))),X0),
inference(superposition,[status(thm)],[c_50,c_51]) ).
tcf(c_268,plain,
! [X0: $i,X1: $i] : join(complement(join(X0,complement(X1))),complement(join(complement(X1),complement(X0)))) = X1,
inference(superposition,[status(thm)],[c_52,c_71]) ).
tcf(c_384,plain,
join(sK0,sK1) = sK1,
inference(superposition,[status(thm)],[c_71,c_237]) ).
tcf(c_386,plain,
join(sK1,sK0) = sK1,
inference(theory_normalisation,[status(thm)],[c_384,c_51,c_52]) ).
tcf(c_388,plain,
join(sK2,sK0) != sK2,
inference(backward_subsumption_resolution,[status(thm)],[c_69,c_386]) ).
tcf(c_4468,plain,
join(sK0,sK2) = sK2,
inference(superposition,[status(thm)],[c_268,c_237]) ).
tcf(c_4479,plain,
join(sK2,sK0) = sK2,
inference(theory_normalisation,[status(thm)],[c_4468,c_51,c_52]) ).
tcf(c_4480,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4479,c_388]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL046+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.11/0.38 % Computer : n020.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 07:38:04 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 3.94/1.30 % SZS status Started for theBenchmark.p
% 3.94/1.30 % SZS status Theorem for theBenchmark.p
% 3.94/1.30
% 3.94/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.94/1.30
% 3.94/1.30 % ------ iProver source info
% 3.94/1.30
% 3.94/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.94/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.94/1.30 % git: non_committed_changes: false
% 3.94/1.30
% 3.94/1.30 % ------ Parsing...
% 3.94/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.94/1.30
% 3.94/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.94/1.30
% 3.94/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.94/1.30
% 3.94/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.94/1.30 % ------ Proving...
% 3.94/1.30 % ------ Problem Properties
% 3.94/1.30
% 3.94/1.30 %
% 3.94/1.30 % clauses 11
% 3.94/1.30 % conjectures 2
% 3.94/1.30 % EPR 0
% 3.94/1.30 % Horn 11
% 3.94/1.30 % unary 10
% 3.94/1.30 % binary 1
% 3.94/1.30 % lits 12
% 3.94/1.30 % lits eq 12
% 3.94/1.30 % fd_pure 0
% 3.94/1.30 % fd_pseudo 0
% 3.94/1.30 % fd_cond 0
% 3.94/1.30 % fd_pseudo_cond 0
% 3.94/1.30 % AC symbols 1
% 3.94/1.30
% 3.94/1.30 % ------ Schedule dynamic 5 is on
% 3.94/1.30
% 3.94/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.94/1.30
% 3.94/1.30
% 3.94/1.30 % ------
% 3.94/1.30 % Current options:
% 3.94/1.30 % ------
% 3.94/1.30
% 3.94/1.30
% 3.94/1.30 %
% 3.94/1.30
% 3.94/1.30 % ------ Proving...
% 3.94/1.30 %
% 3.94/1.30
% 3.94/1.30 % SZS status Theorem for theBenchmark.p
% 3.94/1.30
% 3.94/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.94/1.30
% 3.94/1.30
%------------------------------------------------------------------------------