%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LAT045-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n015.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 01:58:10 PM UTC 2026
% Result : Unsatisfiable 3.39s 1.18s
% Output : CNFRefutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 23 unt; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 37 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : meet(X0,join(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
fof(f5,axiom,
! [X0,X1] : meet(X0,X1) = meet(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
fof(f6,axiom,
! [X0,X1] : join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
fof(f7,axiom,
! [X2,X0,X1] : meet(meet(X0,X1),X2) = meet(X0,meet(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
fof(f8,axiom,
! [X2,X0,X1] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
fof(f11,axiom,
! [X0] : join(complement(X0),X0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability1) ).
fof(f14,axiom,
! [X2,X0,X1] : join(X0,meet(X1,join(X0,X2))) = meet(join(X0,X1),join(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modular_law) ).
fof(f15,negated_conjecture,
join(a,meet(complement(a),join(a,b))) != join(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_orthomodular_law) ).
fof(f16,plain,
join(a,b) != join(a,meet(complement(a),join(a,b))),
inference(reorient_equations,[],[f15]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] : meet(X0,join(X0,X1)) = X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] : meet(X0,X1) = meet(X1,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] : meet(meet(X0,X1),X2) = meet(X0,meet(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
inference(cnf_transformation,[],[f8]) ).
tcf(c_74,plain,
! [X0: $i] : join(complement(X0),X0) = n1,
inference(cnf_transformation,[],[f11]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i,X2: $i] : join(X0,meet(X1,join(X0,X2))) = meet(join(X0,X1),join(X0,X2)),
inference(cnf_transformation,[],[f14]) ).
tcf(c_78,negated_conjecture,
join(a,meet(complement(a),join(a,b))) != join(a,b),
inference(cnf_transformation,[],[f16]) ).
tcf(c_93,plain,
! [X0: $i] : join(X0,complement(X0)) = n1,
inference(theory_normalisation,[status(thm)],[c_74,c_70,c_68,c_71,c_69]) ).
tcf(c_204,plain,
! [X0: $i] : meet(X0,n1) = X0,
inference(superposition,[status(thm)],[c_93,c_66]) ).
tcf(c_238,plain,
! [X0: $i] : meet(n1,X0) = X0,
inference(superposition,[status(thm)],[c_68,c_204]) ).
tcf(c_607,plain,
! [X0: $i,X1: $i] : join(X0,meet(complement(X0),join(X0,X1))) = meet(n1,join(X0,X1)),
inference(superposition,[status(thm)],[c_93,c_77]) ).
tcf(c_655,plain,
meet(n1,join(a,b)) != join(a,b),
inference(demodulation,[status(thm)],[c_78,c_607]) ).
tcf(c_656,plain,
$false,
inference(ground_joinability,[status(thm)],[c_655,c_238]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT045-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n015.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Wed Sep 23 20:08:56 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running UEQ theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 3.39/1.18 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.39/1.18 % SZS status Started for theBenchmark.p
% 3.39/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.39/1.18
% 3.39/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.39/1.18
% 3.39/1.18 % ------ iProver source info
% 3.39/1.18
% 3.39/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 3.39/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.39/1.18 % git: non_committed_changes: false
% 3.39/1.18
% 3.39/1.18 % ------ Parsing...% successful
% 3.39/1.18
% 3.39/1.18
% 3.39/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.39/1.18
% 3.39/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.39/1.18
% 3.39/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.39/1.18
% 3.39/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.39/1.18 % ------ Proving...
% 3.39/1.18 % ------ Problem Properties
% 3.39/1.18
% 3.39/1.18 %
% 3.39/1.18 % clauses 15
% 3.39/1.18 % conjectures 1
% 3.39/1.18 % EPR 0
% 3.39/1.18 % Horn 15
% 3.39/1.18 % unary 15
% 3.39/1.18 % binary 0
% 3.39/1.18 % lits 15
% 3.39/1.18 % lits eq 15
% 3.39/1.18 % fd_pure 0
% 3.39/1.18 % fd_pseudo 0
% 3.39/1.18 % fd_cond 0
% 3.39/1.18 % fd_pseudo_cond 0
% 3.39/1.18 % AC symbols 2
% 3.39/1.18
% 3.39/1.18 % ------ Input Options Time Limit: Unbounded
% 3.39/1.18
% 3.39/1.18
% 3.39/1.18 % ------
% 3.39/1.18 % Current options:
% 3.39/1.18 % ------
% 3.39/1.18
% 3.39/1.18
% 3.39/1.18 %
% 3.39/1.18
% 3.39/1.18 % ------ Proving...
% 3.39/1.18 %
% 3.39/1.18
% 3.39/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.39/1.18
% 3.39/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.39/1.18
% 3.39/1.18
%------------------------------------------------------------------------------