TSTP Solution File: LAT160-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT160-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:09:57 EDT 2023
% Result : Unsatisfiable 257.76s 34.43s
% Output : CNFRefutation 257.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of clauses : 55 ( 55 unt; 0 nHn; 3 RR)
% Number of literals : 55 ( 54 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 145 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.i74G1vr41K/E---3.1_28293.p',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.i74G1vr41K/E---3.1_28293.p',idempotence_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.i74G1vr41K/E---3.1_28293.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.i74G1vr41K/E---3.1_28293.p',commutativity_of_join) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.i74G1vr41K/E---3.1_28293.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.i74G1vr41K/E---3.1_28293.p',associativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.i74G1vr41K/E---3.1_28293.p',absorption2) ).
cnf(equation_H52,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,join(meet(X3,X4),meet(X3,join(X1,X2))))),
file('/export/starexec/sandbox2/tmp/tmp.i74G1vr41K/E---3.1_28293.p',equation_H52) ).
cnf(prove_H51,negated_conjecture,
meet(a,join(b,meet(c,join(a,d)))) != meet(a,join(b,join(meet(a,c),meet(c,d)))),
file('/export/starexec/sandbox2/tmp/tmp.i74G1vr41K/E---3.1_28293.p',prove_H51) ).
cnf(c_0_9,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_10,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_11,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_12,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_13,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_15,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_18,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_19,plain,
meet(X1,meet(join(X2,X1),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_20,plain,
meet(X1,meet(X2,meet(X1,X3))) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_16]),c_0_9]),c_0_9]) ).
cnf(c_0_21,plain,
meet(X1,join(X2,join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_22,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_23,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_9]),c_0_9]),c_0_20]) ).
cnf(c_0_24,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_9]) ).
cnf(c_0_25,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
join(meet(X1,X2),meet(X1,meet(X3,X2))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
join(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X2,join(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_24]),c_0_12]) ).
cnf(c_0_28,plain,
meet(join(X1,X2),join(meet(X1,X3),X2)) = join(meet(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_25]),c_0_14]) ).
cnf(c_0_29,plain,
join(meet(X1,X2),meet(X1,join(X2,X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_11]),c_0_12]) ).
cnf(c_0_30,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_11]),c_0_17]) ).
cnf(c_0_31,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_32,plain,
join(meet(X1,X2),meet(X1,join(X3,X2))) = meet(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_33,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,join(meet(X3,X4),meet(X3,join(X1,X2))))),
equation_H52 ).
cnf(c_0_34,plain,
join(meet(X1,meet(X2,X3)),meet(X1,join(X2,X4))) = meet(X1,join(X2,X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_9]),c_0_15]),c_0_9]) ).
cnf(c_0_35,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_9]) ).
cnf(c_0_36,plain,
meet(join(X1,X2),join(X2,X1)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_30]) ).
cnf(c_0_37,plain,
join(meet(X1,X2),meet(join(X1,X3),X2)) = meet(join(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_31]),c_0_12]) ).
cnf(c_0_38,plain,
join(meet(X1,meet(X2,X3)),meet(X1,join(X4,X2))) = meet(X1,join(X4,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_32]),c_0_9]),c_0_15]),c_0_9]) ).
cnf(c_0_39,plain,
meet(X1,join(X2,meet(X3,join(X1,X2)))) = meet(X1,join(X2,meet(X3,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_18]) ).
cnf(c_0_40,plain,
join(X1,join(X2,meet(X3,join(X2,X1)))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_17]) ).
cnf(c_0_41,plain,
join(X1,meet(join(X1,X2),join(X1,X3))) = meet(join(X1,X2),join(X1,X3)),
inference(spm,[status(thm)],[c_0_37,c_0_11]) ).
cnf(c_0_42,plain,
join(meet(X1,X2),meet(X1,meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_43,plain,
meet(X1,join(X2,meet(X3,join(X1,meet(X2,X4))))) = meet(X1,join(X2,meet(X3,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_38]),c_0_39]) ).
cnf(c_0_44,plain,
join(X1,meet(join(X2,X3),join(X2,X1))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_46,plain,
join(meet(X1,X2),meet(X2,X1)) = meet(X1,X2),
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_10]),c_0_9]),c_0_16]),c_0_9]),c_0_16]) ).
cnf(c_0_47,plain,
meet(X1,join(X2,join(X3,meet(X4,join(X1,X2))))) = meet(X1,join(X2,join(X3,meet(X4,X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_17]),c_0_17]) ).
cnf(c_0_48,plain,
join(X1,join(X2,X3)) = join(X3,join(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_30]),c_0_17]),c_0_30]) ).
cnf(c_0_49,plain,
join(meet(X1,X2),join(meet(X2,X1),X3)) = join(meet(X1,X2),X3),
inference(spm,[status(thm)],[c_0_17,c_0_46]) ).
cnf(c_0_50,plain,
meet(X1,join(X2,join(meet(X3,X4),meet(X3,X1)))) = meet(X1,join(X2,meet(X3,join(X1,X4)))),
inference(rw,[status(thm)],[c_0_33,c_0_47]) ).
cnf(c_0_51,plain,
join(meet(X1,X2),X3) = join(X3,meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_46]) ).
cnf(c_0_52,negated_conjecture,
meet(a,join(b,meet(c,join(a,d)))) != meet(a,join(b,join(meet(a,c),meet(c,d)))),
prove_H51 ).
cnf(c_0_53,plain,
meet(X1,join(X2,join(meet(X1,X3),meet(X3,X4)))) = meet(X1,join(X2,meet(X3,join(X1,X4)))),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : LAT160-1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n029.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 2400
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon Oct 2 10:13:06 EDT 2023
% 0.14/0.38 % CPUTime :
% 0.22/0.52 Running first-order model finding
% 0.22/0.52 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.i74G1vr41K/E---3.1_28293.p
% 257.76/34.43 # Version: 3.1pre001
% 257.76/34.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 257.76/34.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 257.76/34.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 257.76/34.43 # Starting new_bool_3 with 300s (1) cores
% 257.76/34.43 # Starting new_bool_1 with 300s (1) cores
% 257.76/34.43 # Starting sh5l with 300s (1) cores
% 257.76/34.43 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 28370 completed with status 0
% 257.76/34.43 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 257.76/34.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 257.76/34.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 257.76/34.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 257.76/34.43 # No SInE strategy applied
% 257.76/34.43 # Search class: FUUPM-FFSF22-MFFFFFNN
% 257.76/34.43 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 257.76/34.43 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 257.76/34.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 257.76/34.43 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 257.76/34.43 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 257.76/34.43 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 257.76/34.43 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 28380 completed with status 0
% 257.76/34.43 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 257.76/34.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 257.76/34.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 257.76/34.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 257.76/34.43 # No SInE strategy applied
% 257.76/34.43 # Search class: FUUPM-FFSF22-MFFFFFNN
% 257.76/34.43 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 257.76/34.43 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 257.76/34.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 257.76/34.43 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 257.76/34.43 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 257.76/34.43 # Preprocessing time : 0.001 s
% 257.76/34.43 # Presaturation interreduction done
% 257.76/34.43
% 257.76/34.43 # Proof found!
% 257.76/34.43 # SZS status Unsatisfiable
% 257.76/34.43 # SZS output start CNFRefutation
% See solution above
% 257.76/34.43 # Parsed axioms : 10
% 257.76/34.43 # Removed by relevancy pruning/SinE : 0
% 257.76/34.43 # Initial clauses : 10
% 257.76/34.43 # Removed in clause preprocessing : 0
% 257.76/34.43 # Initial clauses in saturation : 10
% 257.76/34.43 # Processed clauses : 98993
% 257.76/34.43 # ...of these trivial : 41341
% 257.76/34.43 # ...subsumed : 56442
% 257.76/34.43 # ...remaining for further processing : 1210
% 257.76/34.43 # Other redundant clauses eliminated : 0
% 257.76/34.43 # Clauses deleted for lack of memory : 0
% 257.76/34.43 # Backward-subsumed : 0
% 257.76/34.43 # Backward-rewritten : 11
% 257.76/34.43 # Generated clauses : 2139288
% 257.76/34.43 # ...of the previous two non-redundant : 1257808
% 257.76/34.43 # ...aggressively subsumed : 0
% 257.76/34.43 # Contextual simplify-reflections : 0
% 257.76/34.43 # Paramodulations : 2139288
% 257.76/34.43 # Factorizations : 0
% 257.76/34.43 # NegExts : 0
% 257.76/34.43 # Equation resolutions : 0
% 257.76/34.43 # Total rewrite steps : 3419428
% 257.76/34.43 # Propositional unsat checks : 0
% 257.76/34.43 # Propositional check models : 0
% 257.76/34.43 # Propositional check unsatisfiable : 0
% 257.76/34.43 # Propositional clauses : 0
% 257.76/34.43 # Propositional clauses after purity: 0
% 257.76/34.43 # Propositional unsat core size : 0
% 257.76/34.43 # Propositional preprocessing time : 0.000
% 257.76/34.43 # Propositional encoding time : 0.000
% 257.76/34.43 # Propositional solver time : 0.000
% 257.76/34.43 # Success case prop preproc time : 0.000
% 257.76/34.43 # Success case prop encoding time : 0.000
% 257.76/34.43 # Success case prop solver time : 0.000
% 257.76/34.43 # Current number of processed clauses : 1189
% 257.76/34.43 # Positive orientable unit clauses : 1179
% 257.76/34.43 # Positive unorientable unit clauses: 10
% 257.76/34.43 # Negative unit clauses : 0
% 257.76/34.43 # Non-unit-clauses : 0
% 257.76/34.43 # Current number of unprocessed clauses: 1158773
% 257.76/34.43 # ...number of literals in the above : 1158773
% 257.76/34.43 # Current number of archived formulas : 0
% 257.76/34.43 # Current number of archived clauses : 21
% 257.76/34.43 # Clause-clause subsumption calls (NU) : 0
% 257.76/34.43 # Rec. Clause-clause subsumption calls : 0
% 257.76/34.43 # Non-unit clause-clause subsumptions : 0
% 257.76/34.43 # Unit Clause-clause subsumption calls : 66
% 257.76/34.43 # Rewrite failures with RHS unbound : 0
% 257.76/34.43 # BW rewrite match attempts : 72648
% 257.76/34.43 # BW rewrite match successes : 304
% 257.76/34.43 # Condensation attempts : 0
% 257.76/34.43 # Condensation successes : 0
% 257.76/34.43 # Termbank termtop insertions : 28421278
% 257.76/34.43
% 257.76/34.43 # -------------------------------------------------
% 257.76/34.43 # User time : 31.403 s
% 257.76/34.43 # System time : 0.955 s
% 257.76/34.43 # Total time : 32.357 s
% 257.76/34.43 # Maximum resident set size: 1516 pages
% 257.76/34.43
% 257.76/34.43 # -------------------------------------------------
% 257.76/34.43 # User time : 154.713 s
% 257.76/34.43 # System time : 4.700 s
% 257.76/34.43 # Total time : 159.413 s
% 257.76/34.43 # Maximum resident set size: 1676 pages
% 257.76/34.43 % E---3.1 exiting
%------------------------------------------------------------------------------