TSTP Solution File: LAT241-10 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT241-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:10:11 EDT 2023
% Result : Unsatisfiable 0.77s 0.57s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 49 ( 49 unt; 0 nHn; 11 RR)
% Number of literals : 49 ( 48 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 74 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',idempotence_of_join) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',complement_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',prove_distributivity_hypothesis) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',complement_meet) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',commutativity_of_join) ).
cnf(equation_H51,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,join(meet(X1,X3),meet(X3,X4)))),
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',equation_H51) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',absorption1) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',associativity_of_meet) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',prove_distributivity) ).
cnf(meet_join_complement,axiom,
ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',meet_join_complement) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p',ifeq_axiom) ).
cnf(c_0_14,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_15,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_16,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_18,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_19,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_20,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_21,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_22,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_23,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_26,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_27,plain,
join(X1,join(complement(X1),X2)) = join(one,X2),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_28,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_14]) ).
cnf(c_0_30,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22]) ).
cnf(c_0_31,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,join(meet(X1,X3),meet(X3,X4)))),
equation_H51 ).
cnf(c_0_32,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_33,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,hypothesis,
join(a,join(X1,b)) = join(X1,b),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_36,plain,
meet(X1,join(X2,meet(complement(X1),join(X1,X3)))) = meet(X1,join(X2,meet(complement(X1),X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_21]),c_0_32]) ).
cnf(c_0_37,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_22]) ).
cnf(c_0_38,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_17]) ).
cnf(c_0_39,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_40,hypothesis,
meet(b,join(X1,meet(complement(a),complement(b)))) = meet(b,join(X1,complement(b))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_19]) ).
cnf(c_0_41,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_39,c_0_25]) ).
cnf(c_0_42,hypothesis,
meet(b,join(complement(a),complement(b))) = meet(b,complement(a)),
inference(spm,[status(thm)],[c_0_40,c_0_18]) ).
cnf(c_0_43,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_44,axiom,
ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2) = X2,
meet_join_complement ).
cnf(c_0_45,hypothesis,
meet(a,join(complement(a),complement(b))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_41]),c_0_21]) ).
cnf(c_0_46,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_47,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_43,c_0_22]) ).
cnf(c_0_48,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_33]),c_0_46]),c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LAT241-10 : TPTP v8.1.2. Released v7.5.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.12/0.35 % Computer : n017.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 2400
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Mon Oct 2 09:30:41 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.DLyVt04v3v/E---3.1_5987.p
% 0.77/0.57 # Version: 3.1pre001
% 0.77/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.77/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.77/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.77/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.77/0.57 # Starting sh5l with 300s (1) cores
% 0.77/0.57 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 6064 completed with status 0
% 0.77/0.57 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.77/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.77/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.77/0.57 # No SInE strategy applied
% 0.77/0.57 # Search class: FUUPM-FFSF32-MFFFFFNN
% 0.77/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.77/0.57 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 0.77/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.77/0.57 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.77/0.57 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.77/0.57 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.77/0.57 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 6070 completed with status 0
% 0.77/0.57 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.77/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.77/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.77/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.77/0.57 # No SInE strategy applied
% 0.77/0.57 # Search class: FUUPM-FFSF32-MFFFFFNN
% 0.77/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.77/0.57 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 0.77/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.77/0.57 # Preprocessing time : 0.001 s
% 0.77/0.57
% 0.77/0.57 # Proof found!
% 0.77/0.57 # SZS status Unsatisfiable
% 0.77/0.57 # SZS output start CNFRefutation
% See solution above
% 0.77/0.57 # Parsed axioms : 15
% 0.77/0.57 # Removed by relevancy pruning/SinE : 0
% 0.77/0.57 # Initial clauses : 15
% 0.77/0.57 # Removed in clause preprocessing : 0
% 0.77/0.57 # Initial clauses in saturation : 15
% 0.77/0.57 # Processed clauses : 303
% 0.77/0.57 # ...of these trivial : 136
% 0.77/0.57 # ...subsumed : 46
% 0.77/0.57 # ...remaining for further processing : 121
% 0.77/0.57 # Other redundant clauses eliminated : 0
% 0.77/0.57 # Clauses deleted for lack of memory : 0
% 0.77/0.57 # Backward-subsumed : 0
% 0.77/0.57 # Backward-rewritten : 9
% 0.77/0.57 # Generated clauses : 5990
% 0.77/0.57 # ...of the previous two non-redundant : 3726
% 0.77/0.57 # ...aggressively subsumed : 0
% 0.77/0.57 # Contextual simplify-reflections : 0
% 0.77/0.57 # Paramodulations : 5990
% 0.77/0.57 # Factorizations : 0
% 0.77/0.57 # NegExts : 0
% 0.77/0.57 # Equation resolutions : 0
% 0.77/0.57 # Total rewrite steps : 7738
% 0.77/0.57 # Propositional unsat checks : 0
% 0.77/0.57 # Propositional check models : 0
% 0.77/0.57 # Propositional check unsatisfiable : 0
% 0.77/0.57 # Propositional clauses : 0
% 0.77/0.57 # Propositional clauses after purity: 0
% 0.77/0.57 # Propositional unsat core size : 0
% 0.77/0.57 # Propositional preprocessing time : 0.000
% 0.77/0.57 # Propositional encoding time : 0.000
% 0.77/0.57 # Propositional solver time : 0.000
% 0.77/0.57 # Success case prop preproc time : 0.000
% 0.77/0.57 # Success case prop encoding time : 0.000
% 0.77/0.57 # Success case prop solver time : 0.000
% 0.77/0.57 # Current number of processed clauses : 112
% 0.77/0.57 # Positive orientable unit clauses : 105
% 0.77/0.57 # Positive unorientable unit clauses: 6
% 0.77/0.57 # Negative unit clauses : 1
% 0.77/0.57 # Non-unit-clauses : 0
% 0.77/0.57 # Current number of unprocessed clauses: 3419
% 0.77/0.57 # ...number of literals in the above : 3419
% 0.77/0.57 # Current number of archived formulas : 0
% 0.77/0.57 # Current number of archived clauses : 9
% 0.77/0.57 # Clause-clause subsumption calls (NU) : 0
% 0.77/0.57 # Rec. Clause-clause subsumption calls : 0
% 0.77/0.57 # Non-unit clause-clause subsumptions : 0
% 0.77/0.57 # Unit Clause-clause subsumption calls : 15
% 0.77/0.57 # Rewrite failures with RHS unbound : 0
% 0.77/0.57 # BW rewrite match attempts : 245
% 0.77/0.57 # BW rewrite match successes : 77
% 0.77/0.57 # Condensation attempts : 0
% 0.77/0.57 # Condensation successes : 0
% 0.77/0.57 # Termbank termtop insertions : 78747
% 0.77/0.57
% 0.77/0.57 # -------------------------------------------------
% 0.77/0.57 # User time : 0.073 s
% 0.77/0.57 # System time : 0.003 s
% 0.77/0.57 # Total time : 0.076 s
% 0.77/0.57 # Maximum resident set size: 1524 pages
% 0.77/0.57
% 0.77/0.57 # -------------------------------------------------
% 0.77/0.57 # User time : 0.348 s
% 0.77/0.57 # System time : 0.029 s
% 0.77/0.57 # Total time : 0.377 s
% 0.77/0.57 # Maximum resident set size: 1676 pages
% 0.77/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------