TSTP Solution File: LAT255-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LAT255-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:16:25 EDT 2024
% Result : Unsatisfiable 47.49s 6.53s
% Output : CNFRefutation 47.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 62 ( 58 unt; 0 nHn; 19 RR)
% Number of literals : 70 ( 69 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 12 ( 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 : 87 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',idempotence_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',prove_distributivity_hypothesis) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',complement_join) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',commutativity_of_join) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',absorption1) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',complement_meet) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',meet_join_complement) ).
cnf(equation_H80,axiom,
meet(X1,join(meet(X1,X2),meet(X3,join(X1,meet(X2,join(X1,X3)))))) = join(meet(X1,X2),meet(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',equation_H80) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',associativity_of_meet) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox2/tmp/tmp.oq7SRzxvQP/E---3.1_14403.p',prove_distributivity) ).
cnf(c_0_13,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_14,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_15,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_16,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_17,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_18,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_20,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_22,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_23,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_24,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_25,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_27,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_28,axiom,
meet(X1,join(meet(X1,X2),meet(X3,join(X1,meet(X2,join(X1,X3)))))) = join(meet(X1,X2),meet(X1,X3)),
equation_H80 ).
cnf(c_0_29,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_30,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_31,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_32,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_22]),c_0_13]) ).
cnf(c_0_33,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
c_0_26 ).
cnf(c_0_34,hypothesis,
join(a,join(b,X1)) = join(b,X1),
inference(spm,[status(thm)],[c_0_13,c_0_27]) ).
cnf(c_0_35,plain,
meet(X1,join(meet(X1,X2),meet(complement(X1),join(X1,X2)))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_19]),c_0_24]),c_0_29]),c_0_30]) ).
cnf(c_0_36,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_19]),c_0_31]) ).
cnf(c_0_37,hypothesis,
join(a,join(X1,b)) = join(X1,b),
inference(spm,[status(thm)],[c_0_32,c_0_27]) ).
cnf(c_0_38,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X2,X1) != one ),
inference(spm,[status(thm)],[c_0_33,c_0_22]) ).
cnf(c_0_39,hypothesis,
meet(a,join(b,X1)) = a,
inference(spm,[status(thm)],[c_0_23,c_0_34]) ).
cnf(c_0_40,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_41,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_42,plain,
meet(X1,join(meet(X1,X2),meet(complement(X1),join(X2,X1)))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_22]) ).
cnf(c_0_43,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_22]) ).
cnf(c_0_44,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_19]),c_0_16]),c_0_24])]) ).
cnf(c_0_45,plain,
meet(X1,join(meet(X1,X2),join(meet(X1,X3),meet(X4,join(X1,meet(join(meet(X1,X2),meet(X3,join(X1,meet(X2,join(X1,X3))))),join(X1,X4))))))) = join(meet(X1,X2),join(meet(X1,X3),meet(X1,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_28]),c_0_13]),c_0_13]) ).
cnf(c_0_46,hypothesis,
meet(a,join(X1,b)) = a,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
join(X1,complement(meet(X1,X2))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_19]),c_0_25]) ).
cnf(c_0_48,hypothesis,
meet(complement(a),join(a,meet(b,complement(a)))) = meet(b,complement(a)),
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_42,c_0_43]),c_0_16]),c_0_44]),c_0_29]),c_0_22]),c_0_16]) ).
cnf(c_0_49,hypothesis,
meet(X1,join(meet(X1,a),join(meet(X1,b),meet(X2,join(X1,meet(join(meet(X1,a),meet(b,join(X1,a))),join(X1,X2))))))) = join(meet(X1,a),join(meet(X1,b),meet(X1,X2))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,hypothesis,
join(complement(a),complement(meet(b,complement(a)))) = one,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_29]) ).
cnf(c_0_52,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_53,hypothesis,
join(meet(b,complement(a)),meet(complement(a),complement(meet(b,complement(a))))) = complement(a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_49,c_0_50]),c_0_16]),c_0_24]),c_0_16]),c_0_16]),c_0_24]),c_0_22]),c_0_19]),c_0_16]),c_0_51]),c_0_52]),c_0_16]),c_0_51]),c_0_22]),c_0_43]),c_0_29]),c_0_19]),c_0_25]),c_0_29]),c_0_16]),c_0_24]),c_0_16]),c_0_52]) ).
cnf(c_0_54,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_55,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_56,hypothesis,
join(b,meet(complement(a),complement(meet(b,complement(a))))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_53]),c_0_43]) ).
cnf(c_0_57,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_24,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_55 ).
cnf(c_0_59,hypothesis,
meet(complement(a),complement(meet(b,complement(a)))) = complement(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_56]),c_0_57])]) ).
cnf(c_0_60,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_58,c_0_22]) ).
cnf(c_0_61,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_59]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT255-1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 08:08:10 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.oq7SRzxvQP/E---3.1_14403.p
% 47.49/6.53 # Version: 3.1.0
% 47.49/6.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 47.49/6.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.49/6.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 47.49/6.53 # Starting new_bool_3 with 300s (1) cores
% 47.49/6.53 # Starting new_bool_1 with 300s (1) cores
% 47.49/6.53 # Starting sh5l with 300s (1) cores
% 47.49/6.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 14503 completed with status 0
% 47.49/6.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 47.49/6.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 47.49/6.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.49/6.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 47.49/6.53 # No SInE strategy applied
% 47.49/6.53 # Search class: FHUPM-FFSF21-DFFFFFNN
% 47.49/6.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 47.49/6.53 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 47.49/6.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 47.49/6.53 # Starting new_bool_3 with 136s (1) cores
% 47.49/6.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 47.49/6.53 # Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 47.49/6.53 # G-E--_303_C18_F1_URBAN_S0Y with pid 14514 completed with status 0
% 47.49/6.53 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 47.49/6.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 47.49/6.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.49/6.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 47.49/6.53 # No SInE strategy applied
% 47.49/6.53 # Search class: FHUPM-FFSF21-DFFFFFNN
% 47.49/6.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 47.49/6.53 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 47.49/6.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 47.49/6.53 # Starting new_bool_3 with 136s (1) cores
% 47.49/6.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 47.49/6.53 # Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 47.49/6.53 # Preprocessing time : 0.001 s
% 47.49/6.53
% 47.49/6.53 # Proof found!
% 47.49/6.53 # SZS status Unsatisfiable
% 47.49/6.53 # SZS output start CNFRefutation
% See solution above
% 47.49/6.53 # Parsed axioms : 14
% 47.49/6.53 # Removed by relevancy pruning/SinE : 0
% 47.49/6.53 # Initial clauses : 14
% 47.49/6.53 # Removed in clause preprocessing : 0
% 47.49/6.53 # Initial clauses in saturation : 14
% 47.49/6.53 # Processed clauses : 4063
% 47.49/6.53 # ...of these trivial : 797
% 47.49/6.53 # ...subsumed : 2676
% 47.49/6.53 # ...remaining for further processing : 590
% 47.49/6.53 # Other redundant clauses eliminated : 0
% 47.49/6.53 # Clauses deleted for lack of memory : 0
% 47.49/6.53 # Backward-subsumed : 47
% 47.49/6.53 # Backward-rewritten : 42
% 47.49/6.53 # Generated clauses : 228408
% 47.49/6.53 # ...of the previous two non-redundant : 166736
% 47.49/6.53 # ...aggressively subsumed : 0
% 47.49/6.53 # Contextual simplify-reflections : 2
% 47.49/6.53 # Paramodulations : 228406
% 47.49/6.53 # Factorizations : 0
% 47.49/6.53 # NegExts : 0
% 47.49/6.53 # Equation resolutions : 2
% 47.49/6.53 # Disequality decompositions : 0
% 47.49/6.53 # Total rewrite steps : 586799
% 47.49/6.53 # ...of those cached : 482589
% 47.49/6.53 # Propositional unsat checks : 0
% 47.49/6.53 # Propositional check models : 0
% 47.49/6.53 # Propositional check unsatisfiable : 0
% 47.49/6.53 # Propositional clauses : 0
% 47.49/6.53 # Propositional clauses after purity: 0
% 47.49/6.53 # Propositional unsat core size : 0
% 47.49/6.53 # Propositional preprocessing time : 0.000
% 47.49/6.53 # Propositional encoding time : 0.000
% 47.49/6.53 # Propositional solver time : 0.000
% 47.49/6.53 # Success case prop preproc time : 0.000
% 47.49/6.53 # Success case prop encoding time : 0.000
% 47.49/6.53 # Success case prop solver time : 0.000
% 47.49/6.53 # Current number of processed clauses : 501
% 47.49/6.53 # Positive orientable unit clauses : 370
% 47.49/6.53 # Positive unorientable unit clauses: 8
% 47.49/6.53 # Negative unit clauses : 38
% 47.49/6.53 # Non-unit-clauses : 85
% 47.49/6.53 # Current number of unprocessed clauses: 162381
% 47.49/6.53 # ...number of literals in the above : 189369
% 47.49/6.53 # Current number of archived formulas : 0
% 47.49/6.53 # Current number of archived clauses : 89
% 47.49/6.53 # Clause-clause subsumption calls (NU) : 2153
% 47.49/6.53 # Rec. Clause-clause subsumption calls : 2053
% 47.49/6.53 # Non-unit clause-clause subsumptions : 215
% 47.49/6.53 # Unit Clause-clause subsumption calls : 387
% 47.49/6.53 # Rewrite failures with RHS unbound : 0
% 47.49/6.53 # BW rewrite match attempts : 6455
% 47.49/6.53 # BW rewrite match successes : 283
% 47.49/6.53 # Condensation attempts : 0
% 47.49/6.53 # Condensation successes : 0
% 47.49/6.53 # Termbank termtop insertions : 5962530
% 47.49/6.53 # Search garbage collected termcells : 8
% 47.49/6.53
% 47.49/6.53 # -------------------------------------------------
% 47.49/6.53 # User time : 5.634 s
% 47.49/6.53 # System time : 0.222 s
% 47.49/6.53 # Total time : 5.855 s
% 47.49/6.53 # Maximum resident set size: 1608 pages
% 47.49/6.53
% 47.49/6.53 # -------------------------------------------------
% 47.49/6.53 # User time : 28.396 s
% 47.49/6.53 # System time : 0.873 s
% 47.49/6.53 # Total time : 29.269 s
% 47.49/6.53 # Maximum resident set size: 1696 pages
% 47.49/6.53 % E---3.1 exiting
%------------------------------------------------------------------------------