%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LAT045-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 : Thu Sep 24 01:05:25 PM UTC 2026
% Result : Unsatisfiable 0.52s 0.49s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 5 RR)
% Number of literals : 20 ( 19 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% 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 : 27 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(invertability1,axiom,
join(complement(X1),X1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(prove_orthomodular_law,negated_conjecture,
join(a,meet(complement(a),join(a,b))) != join(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_orthomodular_law) ).
cnf(modular_law,axiom,
join(X1,meet(X2,join(X1,X3))) = meet(join(X1,X2),join(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modular_law) ).
cnf(c_0_6,axiom,
join(complement(X1),X1) = n1,
invertability1 ).
cnf(c_0_7,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_8,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_9,plain,
join(X1,complement(X1)) = n1,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_11,plain,
meet(X1,n1) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
join(a,meet(complement(a),join(a,b))) != join(a,b),
inference(fof_simplification,[status(thm)],[prove_orthomodular_law]) ).
cnf(c_0_13,axiom,
join(X1,meet(X2,join(X1,X3))) = meet(join(X1,X2),join(X1,X3)),
modular_law ).
cnf(c_0_14,plain,
meet(n1,X1) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
join(a,meet(complement(a),join(a,b))) != join(a,b),
c_0_12 ).
cnf(c_0_16,plain,
join(X1,meet(complement(X1),join(X1,X2))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
join(a,meet(join(a,b),complement(a))) != join(a,b),
inference(rw,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_18,plain,
join(X1,meet(join(X1,X2),complement(X1))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT045-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n012.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 23:07:52 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.49 % Version: 3.5.1
% 0.52/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.52/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.52/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.52/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.52/0.49 % Starting sh5l with 300s (1) cores
% 0.52/0.49 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1050949 completed with status 0
% 0.52/0.49 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.52/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.52/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.52/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.52/0.49 % No SInE strategy applied
% 0.52/0.49 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.52/0.49 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.52/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.52/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.52/0.49 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.52/0.49 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.52/0.49 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.52/0.49 % U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 1050959 completed with status 0
% 0.52/0.49 % Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.52/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.52/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.52/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.52/0.49 % No SInE strategy applied
% 0.52/0.49 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.52/0.49 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.52/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.52/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.52/0.49 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.52/0.49 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.52/0.49 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.52/0.49 % Preprocessing time : 0.001 s
% 0.52/0.49
% 0.52/0.49 % Proof found!
% 0.52/0.49 % SZS status Unsatisfiable
% 0.52/0.49 % SZS output start CNFRefutation
% See solution above
% 0.52/0.49 % Parsed axioms : 15
% 0.52/0.49 % Removed by relevancy pruning/SinE : 0
% 0.52/0.49 % Initial clauses : 15
% 0.52/0.49 % Removed in clause preprocessing : 0
% 0.52/0.49 % Initial clauses in saturation : 15
% 0.52/0.49 % Processed clauses : 726
% 0.52/0.49 % ...of these trivial : 289
% 0.52/0.49 % ...subsumed : 309
% 0.52/0.49 % ...remaining for further processing : 128
% 0.52/0.49 % Other redundant clauses eliminated : 0
% 0.52/0.49 % Clauses deleted for lack of memory : 0
% 0.52/0.49 % Backward-subsumed : 0
% 0.52/0.49 % Backward-rewritten : 14
% 0.52/0.49 % Generated clauses : 9681
% 0.52/0.49 % ...of the previous two non-redundant : 4275
% 0.52/0.49 % ...aggressively subsumed : 0
% 0.52/0.49 % Contextual simplify-reflections : 0
% 0.52/0.49 % Paramodulations : 9681
% 0.52/0.49 % Factorizations : 0
% 0.52/0.49 % NegExts : 0
% 0.52/0.49 % Equation resolutions : 0
% 0.52/0.49 % Disequality decompositions : 0
% 0.52/0.49 % Total rewrite steps : 18674
% 0.52/0.49 % ...of those cached : 14994
% 0.52/0.49 % Propositional unsat checks : 0
% 0.52/0.49 % Propositional check models : 0
% 0.52/0.49 % Propositional check unsatisfiable : 0
% 0.52/0.49 % Propositional clauses : 0
% 0.52/0.49 % Propositional clauses after purity: 0
% 0.52/0.49 % Propositional unsat core size : 0
% 0.52/0.49 % Propositional preprocessing time : 0.000
% 0.52/0.49 % Propositional encoding time : 0.000
% 0.52/0.49 % Propositional solver time : 0.000
% 0.52/0.49 % Success case prop preproc time : 0.000
% 0.52/0.49 % Success case prop encoding time : 0.000
% 0.52/0.49 % Success case prop solver time : 0.000
% 0.52/0.49 % Current number of processed clauses : 114
% 0.52/0.49 % Positive orientable unit clauses : 105
% 0.52/0.49 % Positive unorientable unit clauses: 9
% 0.52/0.49 % Negative unit clauses : 0
% 0.52/0.49 % Non-unit-clauses : 0
% 0.52/0.49 % Current number of unprocessed clauses: 3517
% 0.52/0.49 % ...number of literals in the above : 3517
% 0.52/0.49 % Current number of archived formulas : 0
% 0.52/0.49 % Current number of archived clauses : 14
% 0.52/0.49 % Clause-clause subsumption calls (NU) : 0
% 0.52/0.49 % Rec. Clause-clause subsumption calls : 0
% 0.52/0.49 % Non-unit clause-clause subsumptions : 0
% 0.52/0.49 % Unit Clause-clause subsumption calls : 40
% 0.52/0.49 % Rewrite failures with RHS unbound : 0
% 0.52/0.49 % BW rewrite match attempts : 499
% 0.52/0.49 % BW rewrite match successes : 325
% 0.52/0.49 % Condensation attempts : 0
% 0.52/0.49 % Condensation successes : 0
% 0.52/0.49 % Termbank termtop insertions : 81923
% 0.52/0.49 % Search garbage collected termcells : 2
% 0.52/0.49
% 0.52/0.49 % -------------------------------------------------
% 0.52/0.49 % User time : 0.071 s
% 0.52/0.49 % System time : 0.005 s
% 0.52/0.49 % Total time : 0.076 s
% 0.52/0.49 % Maximum resident set size: 3384 pages
% 0.52/0.49
% 0.52/0.49 % -------------------------------------------------
% 0.52/0.49 % User time : 0.187 s
% 0.52/0.49 % System time : 0.022 s
% 0.52/0.49 % Total time : 0.210 s
% 0.52/0.49 % Maximum resident set size: 4608 pages
% 0.52/0.49 % E exiting
%------------------------------------------------------------------------------