TSTP Solution File: LAT249-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT249-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:12 EDT 2023
% Result : Unsatisfiable 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 42 ( 40 unt; 0 nHn; 11 RR)
% Number of literals : 46 ( 45 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 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 : 60 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',commutativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',absorption2) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',complement_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',prove_distributivity_hypothesis) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',commutativity_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',idempotence_of_join) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',associativity_of_meet) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',complement_join) ).
cnf(equation_H64,axiom,
meet(X1,join(X2,X3)) = meet(X1,join(X2,meet(X1,join(X3,meet(X1,join(X2,meet(X1,X3))))))),
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',equation_H64) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',prove_distributivity) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p',meet_join_complement) ).
cnf(c_0_13,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_14,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_15,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_16,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_17,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_18,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_19,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_22,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_23,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_24,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_28,axiom,
meet(X1,join(X2,X3)) = meet(X1,join(X2,meet(X1,join(X3,meet(X1,join(X2,meet(X1,X3))))))),
equation_H64 ).
cnf(c_0_29,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_31,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
meet(X1,join(X2,meet(X1,join(complement(X1),meet(X1,X2))))) = meet(X1,join(X2,complement(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_16]),c_0_20]) ).
cnf(c_0_33,hypothesis,
meet(a,complement(b)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_16]),c_0_30]) ).
cnf(c_0_34,plain,
join(X1,join(complement(X1),X2)) = join(one,X2),
inference(spm,[status(thm)],[c_0_21,c_0_27]) ).
cnf(c_0_35,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_14,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_37,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_38,hypothesis,
meet(a,join(complement(a),complement(b))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_20]),c_0_16]),c_0_20]),c_0_33]),c_0_14]) ).
cnf(c_0_39,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_36,c_0_14]) ).
cnf(c_0_41,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT249-1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 10:29:28 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.f5Vf9rHokz/E---3.1_18205.p
% 0.22/0.55 # Version: 3.1pre001
% 0.22/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 # Starting sh5l with 300s (1) cores
% 0.22/0.55 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 18282 completed with status 0
% 0.22/0.55 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.22/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.55 # No SInE strategy applied
% 0.22/0.55 # Search class: FHUPM-FFSF21-DFFFFFNN
% 0.22/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.55 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 0.22/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.55 # Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.22/0.55 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 18288 completed with status 0
% 0.22/0.55 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.22/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.55 # No SInE strategy applied
% 0.22/0.55 # Search class: FHUPM-FFSF21-DFFFFFNN
% 0.22/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.55 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 0.22/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.55 # Preprocessing time : 0.001 s
% 0.22/0.55
% 0.22/0.55 # Proof found!
% 0.22/0.55 # SZS status Unsatisfiable
% 0.22/0.55 # SZS output start CNFRefutation
% See solution above
% 0.22/0.55 # Parsed axioms : 14
% 0.22/0.55 # Removed by relevancy pruning/SinE : 0
% 0.22/0.55 # Initial clauses : 14
% 0.22/0.55 # Removed in clause preprocessing : 0
% 0.22/0.55 # Initial clauses in saturation : 14
% 0.22/0.55 # Processed clauses : 219
% 0.22/0.55 # ...of these trivial : 47
% 0.22/0.55 # ...subsumed : 59
% 0.22/0.55 # ...remaining for further processing : 113
% 0.22/0.55 # Other redundant clauses eliminated : 0
% 0.22/0.55 # Clauses deleted for lack of memory : 0
% 0.22/0.55 # Backward-subsumed : 11
% 0.22/0.55 # Backward-rewritten : 19
% 0.22/0.55 # Generated clauses : 2926
% 0.22/0.55 # ...of the previous two non-redundant : 1885
% 0.22/0.55 # ...aggressively subsumed : 0
% 0.22/0.55 # Contextual simplify-reflections : 2
% 0.22/0.55 # Paramodulations : 2925
% 0.22/0.55 # Factorizations : 0
% 0.22/0.55 # NegExts : 0
% 0.22/0.55 # Equation resolutions : 1
% 0.22/0.55 # Total rewrite steps : 4162
% 0.22/0.55 # Propositional unsat checks : 0
% 0.22/0.55 # Propositional check models : 0
% 0.22/0.55 # Propositional check unsatisfiable : 0
% 0.22/0.55 # Propositional clauses : 0
% 0.22/0.55 # Propositional clauses after purity: 0
% 0.22/0.55 # Propositional unsat core size : 0
% 0.22/0.55 # Propositional preprocessing time : 0.000
% 0.22/0.55 # Propositional encoding time : 0.000
% 0.22/0.55 # Propositional solver time : 0.000
% 0.22/0.55 # Success case prop preproc time : 0.000
% 0.22/0.55 # Success case prop encoding time : 0.000
% 0.22/0.55 # Success case prop solver time : 0.000
% 0.22/0.55 # Current number of processed clauses : 83
% 0.22/0.55 # Positive orientable unit clauses : 57
% 0.22/0.55 # Positive unorientable unit clauses: 6
% 0.22/0.55 # Negative unit clauses : 3
% 0.22/0.55 # Non-unit-clauses : 17
% 0.22/0.55 # Current number of unprocessed clauses: 1661
% 0.22/0.55 # ...number of literals in the above : 2332
% 0.22/0.55 # Current number of archived formulas : 0
% 0.22/0.55 # Current number of archived clauses : 30
% 0.22/0.55 # Clause-clause subsumption calls (NU) : 170
% 0.22/0.55 # Rec. Clause-clause subsumption calls : 113
% 0.22/0.55 # Non-unit clause-clause subsumptions : 36
% 0.22/0.55 # Unit Clause-clause subsumption calls : 32
% 0.22/0.55 # Rewrite failures with RHS unbound : 0
% 0.22/0.55 # BW rewrite match attempts : 126
% 0.22/0.55 # BW rewrite match successes : 75
% 0.22/0.55 # Condensation attempts : 0
% 0.22/0.55 # Condensation successes : 0
% 0.22/0.55 # Termbank termtop insertions : 33717
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.035 s
% 0.22/0.55 # System time : 0.006 s
% 0.22/0.55 # Total time : 0.040 s
% 0.22/0.55 # Maximum resident set size: 1596 pages
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.158 s
% 0.22/0.55 # System time : 0.015 s
% 0.22/0.55 # Total time : 0.173 s
% 0.22/0.55 # Maximum resident set size: 1680 pages
% 0.22/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------