TSTP Solution File: LAT242-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT242-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 63.04s 8.53s
% Output : CNFRefutation 63.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 64 ( 59 unt; 0 nHn; 22 RR)
% Number of literals : 74 ( 73 equ; 13 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 : 94 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.p',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.p',prove_distributivity_hypothesis) ).
cnf(equation_H55,axiom,
join(X1,meet(X2,join(X1,X3))) = join(X1,meet(X2,join(X3,meet(X1,join(X3,X2))))),
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.p',equation_H55) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.p',commutativity_of_join) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.p',absorption1) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.p',complement_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.p',associativity_of_join) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.p',associativity_of_meet) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.p',meet_join_complement) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.p',complement_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.p',idempotence_of_join) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox2/tmp/tmp.lLFBbJFg69/E---3.1_921.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,axiom,
join(X1,meet(X2,join(X1,X3))) = join(X1,meet(X2,join(X3,meet(X1,join(X3,X2))))),
equation_H55 ).
cnf(c_0_17,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_19,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_20,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_21,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_22,plain,
join(X1,meet(X2,join(X3,meet(join(X3,X2),X1)))) = join(X1,meet(X2,join(X1,X3))),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_23,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_24,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_25,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_26,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_27,hypothesis,
join(X1,meet(b,join(a,meet(b,X1)))) = join(X1,meet(b,join(X1,a))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_29,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_26]) ).
cnf(c_0_31,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_32,plain,
join(complement(join(X1,X2)),meet(X2,join(X1,complement(join(X1,X2))))) = join(meet(X2,X1),complement(join(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_25]),c_0_19]),c_0_19]) ).
cnf(c_0_33,hypothesis,
join(complement(b),meet(b,join(a,complement(b)))) = join(a,complement(b)),
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_27,c_0_21]),c_0_25]),c_0_14]),c_0_18]),c_0_19]),c_0_19]) ).
cnf(c_0_34,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_35,plain,
meet(X1,meet(complement(X1),X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_21]),c_0_29]) ).
cnf(c_0_36,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_37,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_38,hypothesis,
join(a,join(X1,b)) = join(X1,b),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_39,plain,
( complement(meet(X1,X2)) = X3
| meet(X1,meet(X2,X3)) != zero
| join(meet(X1,X2),X3) != one ),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_40,hypothesis,
join(complement(join(a,complement(b))),meet(b,meet(join(a,complement(b)),join(complement(b),complement(join(a,complement(b))))))) = complement(join(a,complement(b))),
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_32,c_0_33]),c_0_28]),c_0_28]),c_0_14]),c_0_24]),c_0_21]),c_0_34]) ).
cnf(c_0_41,plain,
meet(X1,meet(X2,complement(X1))) = zero,
inference(spm,[status(thm)],[c_0_35,c_0_14]) ).
cnf(c_0_42,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_14,c_0_29]) ).
cnf(c_0_43,plain,
join(X1,join(X2,complement(join(X1,X2)))) = one,
inference(spm,[status(thm)],[c_0_36,c_0_26]) ).
cnf(c_0_44,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
cnf(c_0_45,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_28]) ).
cnf(c_0_46,hypothesis,
join(b,meet(a,X1)) = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_23]),c_0_19]) ).
cnf(c_0_47,plain,
( complement(meet(X1,X2)) = X3
| meet(X2,meet(X1,X3)) != zero
| join(meet(X1,X2),X3) != one ),
inference(spm,[status(thm)],[c_0_39,c_0_14]) ).
cnf(c_0_48,hypothesis,
meet(b,meet(join(a,complement(b)),join(complement(b),complement(join(a,complement(b)))))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_40]),c_0_28]),c_0_28]),c_0_41]),c_0_42]) ).
cnf(c_0_49,hypothesis,
join(complement(b),join(meet(b,join(a,complement(b))),complement(join(a,complement(b))))) = one,
inference(spm,[status(thm)],[c_0_43,c_0_33]) ).
cnf(c_0_50,plain,
meet(X1,meet(X2,meet(join(X1,X3),X4))) = meet(X1,meet(X4,X2)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,hypothesis,
meet(a,meet(X1,b)) = meet(a,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_46]),c_0_28]) ).
cnf(c_0_52,hypothesis,
join(complement(b),complement(join(a,complement(b)))) = complement(meet(b,join(a,complement(b)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_14]),c_0_14]),c_0_30]),c_0_49])]) ).
cnf(c_0_53,plain,
( complement(X1) = X2
| meet(X2,X1) != zero
| join(X1,X2) != one ),
inference(spm,[status(thm)],[c_0_31,c_0_14]) ).
cnf(c_0_54,hypothesis,
meet(a,complement(meet(b,join(a,complement(b))))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_48]),c_0_42]),c_0_51]),c_0_52]) ).
cnf(c_0_55,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_21]),c_0_19]),c_0_36])]) ).
cnf(c_0_56,hypothesis,
join(a,complement(meet(b,join(a,complement(b))))) = one,
inference(spm,[status(thm)],[c_0_43,c_0_52]) ).
cnf(c_0_57,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_58,hypothesis,
meet(b,join(a,complement(b))) = a,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_19]),c_0_56])]) ).
cnf(c_0_59,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_60,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_26,c_0_57]) ).
cnf(c_0_61,hypothesis,
join(complement(b),complement(join(a,complement(b)))) = complement(a),
inference(rw,[status(thm)],[c_0_52,c_0_58]) ).
cnf(c_0_62,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_59,c_0_19]) ).
cnf(c_0_63,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_19]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LAT242-1 : TPTP v8.1.2. Released v3.1.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n018.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 10:52:23 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 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.lLFBbJFg69/E---3.1_921.p
% 63.04/8.53 # Version: 3.1pre001
% 63.04/8.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 63.04/8.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.04/8.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 63.04/8.53 # Starting new_bool_3 with 300s (1) cores
% 63.04/8.53 # Starting new_bool_1 with 300s (1) cores
% 63.04/8.53 # Starting sh5l with 300s (1) cores
% 63.04/8.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1011 completed with status 0
% 63.04/8.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 63.04/8.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 63.04/8.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.04/8.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 63.04/8.53 # No SInE strategy applied
% 63.04/8.53 # Search class: FHUPM-FFSF21-MFFFFFNN
% 63.04/8.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 63.04/8.53 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 63.04/8.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 63.04/8.53 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 63.04/8.53 # Starting new_bool_3 with 136s (1) cores
% 63.04/8.53 # Starting new_bool_1 with 136s (1) cores
% 63.04/8.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1018 completed with status 0
% 63.04/8.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 63.04/8.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 63.04/8.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.04/8.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 63.04/8.53 # No SInE strategy applied
% 63.04/8.53 # Search class: FHUPM-FFSF21-MFFFFFNN
% 63.04/8.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 63.04/8.53 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 63.04/8.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 63.04/8.53 # Preprocessing time : 0.001 s
% 63.04/8.53
% 63.04/8.53 # Proof found!
% 63.04/8.53 # SZS status Unsatisfiable
% 63.04/8.53 # SZS output start CNFRefutation
% See solution above
% 63.04/8.53 # Parsed axioms : 14
% 63.04/8.53 # Removed by relevancy pruning/SinE : 0
% 63.04/8.53 # Initial clauses : 14
% 63.04/8.53 # Removed in clause preprocessing : 0
% 63.04/8.53 # Initial clauses in saturation : 14
% 63.04/8.53 # Processed clauses : 9004
% 63.04/8.53 # ...of these trivial : 1132
% 63.04/8.53 # ...subsumed : 7116
% 63.04/8.53 # ...remaining for further processing : 756
% 63.04/8.53 # Other redundant clauses eliminated : 0
% 63.04/8.53 # Clauses deleted for lack of memory : 0
% 63.04/8.53 # Backward-subsumed : 84
% 63.04/8.53 # Backward-rewritten : 50
% 63.04/8.53 # Generated clauses : 302122
% 63.04/8.53 # ...of the previous two non-redundant : 217089
% 63.04/8.53 # ...aggressively subsumed : 0
% 63.04/8.53 # Contextual simplify-reflections : 5
% 63.04/8.53 # Paramodulations : 302121
% 63.04/8.53 # Factorizations : 0
% 63.04/8.53 # NegExts : 0
% 63.04/8.53 # Equation resolutions : 1
% 63.04/8.53 # Total rewrite steps : 638383
% 63.04/8.53 # Propositional unsat checks : 0
% 63.04/8.53 # Propositional check models : 0
% 63.04/8.53 # Propositional check unsatisfiable : 0
% 63.04/8.53 # Propositional clauses : 0
% 63.04/8.53 # Propositional clauses after purity: 0
% 63.04/8.53 # Propositional unsat core size : 0
% 63.04/8.53 # Propositional preprocessing time : 0.000
% 63.04/8.53 # Propositional encoding time : 0.000
% 63.04/8.53 # Propositional solver time : 0.000
% 63.04/8.53 # Success case prop preproc time : 0.000
% 63.04/8.53 # Success case prop encoding time : 0.000
% 63.04/8.53 # Success case prop solver time : 0.000
% 63.04/8.53 # Current number of processed clauses : 622
% 63.04/8.53 # Positive orientable unit clauses : 443
% 63.04/8.53 # Positive unorientable unit clauses: 8
% 63.04/8.53 # Negative unit clauses : 27
% 63.04/8.53 # Non-unit-clauses : 144
% 63.04/8.53 # Current number of unprocessed clauses: 206785
% 63.04/8.53 # ...number of literals in the above : 272417
% 63.04/8.53 # Current number of archived formulas : 0
% 63.04/8.53 # Current number of archived clauses : 134
% 63.04/8.53 # Clause-clause subsumption calls (NU) : 7864
% 63.04/8.53 # Rec. Clause-clause subsumption calls : 5592
% 63.04/8.53 # Non-unit clause-clause subsumptions : 1263
% 63.04/8.53 # Unit Clause-clause subsumption calls : 718
% 63.04/8.53 # Rewrite failures with RHS unbound : 0
% 63.04/8.53 # BW rewrite match attempts : 11751
% 63.04/8.53 # BW rewrite match successes : 285
% 63.04/8.53 # Condensation attempts : 0
% 63.04/8.53 # Condensation successes : 0
% 63.04/8.53 # Termbank termtop insertions : 6632542
% 63.04/8.53
% 63.04/8.53 # -------------------------------------------------
% 63.04/8.53 # User time : 7.610 s
% 63.04/8.53 # System time : 0.307 s
% 63.04/8.53 # Total time : 7.917 s
% 63.04/8.53 # Maximum resident set size: 1592 pages
% 63.04/8.53
% 63.04/8.53 # -------------------------------------------------
% 63.04/8.53 # User time : 37.873 s
% 63.04/8.53 # System time : 0.808 s
% 63.04/8.53 # Total time : 38.681 s
% 63.04/8.53 # Maximum resident set size: 1676 pages
% 63.04/8.53 % E---3.1 exiting
%------------------------------------------------------------------------------