TSTP Solution File: LAT233-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT233-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:08:06 EDT 2023
% Result : Unsatisfiable 154.94s 20.02s
% Output : CNFRefutation 154.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 44 unt; 0 nHn; 15 RR)
% Number of literals : 52 ( 51 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 67 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',prove_distributivity_hypothesis) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',idempotence_of_join) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',complement_join) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',absorption1) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',associativity_of_meet) ).
cnf(equation_H24,axiom,
join(meet(X1,X2),meet(X2,X3)) = join(meet(X1,X2),meet(X2,join(meet(X1,X2),meet(X3,join(X1,X2))))),
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',equation_H24) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',commutativity_of_join) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',complement_meet) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',meet_join_complement) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p',prove_distributivity) ).
cnf(c_0_13,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_14,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_15,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_16,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_19,hypothesis,
join(b,a) = b,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_21,hypothesis,
join(b,join(a,X1)) = join(b,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_23,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_24,hypothesis,
join(b,complement(a)) = join(b,one),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_26,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_27,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_28,axiom,
join(meet(X1,X2),meet(X2,X3)) = join(meet(X1,X2),meet(X2,join(meet(X1,X2),meet(X3,join(X1,X2))))),
equation_H24 ).
cnf(c_0_29,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_31,plain,
meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_33,hypothesis,
join(meet(b,complement(a)),meet(complement(a),join(meet(b,complement(a)),X1))) = join(meet(b,complement(a)),meet(complement(a),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_34,plain,
join(meet(X1,X2),meet(X2,join(meet(X1,X2),X3))) = meet(X2,join(meet(X1,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_31]),c_0_32]) ).
cnf(c_0_35,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_36,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_37,hypothesis,
join(meet(b,complement(a)),meet(complement(a),X1)) = meet(complement(a),join(meet(b,complement(a)),X1)),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_39,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_35,c_0_27]) ).
cnf(c_0_40,hypothesis,
join(b,meet(complement(a),join(meet(b,complement(a)),X1))) = join(b,meet(complement(a),X1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( meet(X1,complement(meet(X2,X1))) = complement(X2)
| join(X2,meet(X1,complement(meet(X2,X1)))) != one ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,hypothesis,
join(b,meet(complement(a),complement(meet(b,complement(a))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_22]),c_0_30]),c_0_24]),c_0_25]) ).
cnf(c_0_43,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_44,hypothesis,
meet(complement(a),complement(meet(b,complement(a)))) = complement(b),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_43,c_0_32]) ).
cnf(c_0_46,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.15 % Problem : LAT233-1 : TPTP v8.1.2. Released v3.1.0.
% 0.15/0.16 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n027.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 10:41:15 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.4ODwoAIt8K/E---3.1_29607.p
% 154.94/20.02 # Version: 3.1pre001
% 154.94/20.02 # Preprocessing class: FSSSSMSSSSSNFFN.
% 154.94/20.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 154.94/20.02 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 154.94/20.02 # Starting new_bool_3 with 300s (1) cores
% 154.94/20.02 # Starting new_bool_1 with 300s (1) cores
% 154.94/20.02 # Starting sh5l with 300s (1) cores
% 154.94/20.02 # sh5l with pid 29746 completed with status 0
% 154.94/20.02 # Result found by sh5l
% 154.94/20.02 # Preprocessing class: FSSSSMSSSSSNFFN.
% 154.94/20.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 154.94/20.02 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 154.94/20.02 # Starting new_bool_3 with 300s (1) cores
% 154.94/20.02 # Starting new_bool_1 with 300s (1) cores
% 154.94/20.02 # Starting sh5l with 300s (1) cores
% 154.94/20.02 # SinE strategy is gf500_gu_R04_F100_L20000
% 154.94/20.02 # Search class: FHUPM-FFSF21-MFFFFFNN
% 154.94/20.02 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 154.94/20.02 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 163s (1) cores
% 154.94/20.02 # G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 29754 completed with status 0
% 154.94/20.02 # Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 154.94/20.02 # Preprocessing class: FSSSSMSSSSSNFFN.
% 154.94/20.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 154.94/20.02 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 154.94/20.02 # Starting new_bool_3 with 300s (1) cores
% 154.94/20.02 # Starting new_bool_1 with 300s (1) cores
% 154.94/20.02 # Starting sh5l with 300s (1) cores
% 154.94/20.02 # SinE strategy is gf500_gu_R04_F100_L20000
% 154.94/20.02 # Search class: FHUPM-FFSF21-MFFFFFNN
% 154.94/20.02 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 154.94/20.02 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 163s (1) cores
% 154.94/20.02 # Preprocessing time : 0.001 s
% 154.94/20.02 # Presaturation interreduction done
% 154.94/20.02
% 154.94/20.02 # Proof found!
% 154.94/20.02 # SZS status Unsatisfiable
% 154.94/20.02 # SZS output start CNFRefutation
% See solution above
% 154.94/20.02 # Parsed axioms : 14
% 154.94/20.02 # Removed by relevancy pruning/SinE : 0
% 154.94/20.02 # Initial clauses : 14
% 154.94/20.02 # Removed in clause preprocessing : 0
% 154.94/20.02 # Initial clauses in saturation : 14
% 154.94/20.02 # Processed clauses : 33393
% 154.94/20.02 # ...of these trivial : 16828
% 154.94/20.02 # ...subsumed : 14801
% 154.94/20.02 # ...remaining for further processing : 1764
% 154.94/20.02 # Other redundant clauses eliminated : 0
% 154.94/20.02 # Clauses deleted for lack of memory : 0
% 154.94/20.02 # Backward-subsumed : 19
% 154.94/20.02 # Backward-rewritten : 231
% 154.94/20.02 # Generated clauses : 1319786
% 154.94/20.02 # ...of the previous two non-redundant : 645350
% 154.94/20.02 # ...aggressively subsumed : 0
% 154.94/20.02 # Contextual simplify-reflections : 0
% 154.94/20.02 # Paramodulations : 1319768
% 154.94/20.02 # Factorizations : 0
% 154.94/20.02 # NegExts : 0
% 154.94/20.02 # Equation resolutions : 18
% 154.94/20.02 # Total rewrite steps : 6718888
% 154.94/20.02 # Propositional unsat checks : 0
% 154.94/20.02 # Propositional check models : 0
% 154.94/20.02 # Propositional check unsatisfiable : 0
% 154.94/20.02 # Propositional clauses : 0
% 154.94/20.02 # Propositional clauses after purity: 0
% 154.94/20.02 # Propositional unsat core size : 0
% 154.94/20.02 # Propositional preprocessing time : 0.000
% 154.94/20.02 # Propositional encoding time : 0.000
% 154.94/20.02 # Propositional solver time : 0.000
% 154.94/20.02 # Success case prop preproc time : 0.000
% 154.94/20.02 # Success case prop encoding time : 0.000
% 154.94/20.02 # Success case prop solver time : 0.000
% 154.94/20.02 # Current number of processed clauses : 1500
% 154.94/20.02 # Positive orientable unit clauses : 1340
% 154.94/20.02 # Positive unorientable unit clauses: 10
% 154.94/20.02 # Negative unit clauses : 1
% 154.94/20.02 # Non-unit-clauses : 149
% 154.94/20.02 # Current number of unprocessed clauses: 610412
% 154.94/20.02 # ...number of literals in the above : 642773
% 154.94/20.02 # Current number of archived formulas : 0
% 154.94/20.02 # Current number of archived clauses : 264
% 154.94/20.02 # Clause-clause subsumption calls (NU) : 21562
% 154.94/20.02 # Rec. Clause-clause subsumption calls : 21562
% 154.94/20.02 # Non-unit clause-clause subsumptions : 7054
% 154.94/20.02 # Unit Clause-clause subsumption calls : 652
% 154.94/20.02 # Rewrite failures with RHS unbound : 0
% 154.94/20.02 # BW rewrite match attempts : 26718
% 154.94/20.02 # BW rewrite match successes : 2324
% 154.94/20.02 # Condensation attempts : 0
% 154.94/20.02 # Condensation successes : 0
% 154.94/20.02 # Termbank termtop insertions : 40409290
% 154.94/20.02
% 154.94/20.02 # -------------------------------------------------
% 154.94/20.02 # User time : 18.669 s
% 154.94/20.02 # System time : 0.618 s
% 154.94/20.02 # Total time : 19.287 s
% 154.94/20.02 # Maximum resident set size: 1668 pages
% 154.94/20.02
% 154.94/20.02 # -------------------------------------------------
% 154.94/20.02 # User time : 18.670 s
% 154.94/20.02 # System time : 0.620 s
% 154.94/20.02 # Total time : 19.291 s
% 154.94/20.02 # Maximum resident set size: 1676 pages
% 154.94/20.02 % E---3.1 exiting
% 154.94/20.02 % E---3.1 exiting
%------------------------------------------------------------------------------