TSTP Solution File: LAT009-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT009-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:13 EDT 2023
% Result : Unsatisfiable 5.04s 1.06s
% Output : CNFRefutation 5.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 52 ( 52 unt; 0 nHn; 3 RR)
% Number of literals : 52 ( 51 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 129 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.V6F4VNWIrC/E---3.1_22099.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.V6F4VNWIrC/E---3.1_22099.p',commutativity_of_join) ).
cnf(distributivity_dual,axiom,
join(meet(join(meet(X1,X2),X3),X2),meet(X3,X1)) = meet(join(meet(join(X1,X2),X3),X2),join(X3,X1)),
file('/export/starexec/sandbox/tmp/tmp.V6F4VNWIrC/E---3.1_22099.p',distributivity_dual) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.V6F4VNWIrC/E---3.1_22099.p',commutativity_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.V6F4VNWIrC/E---3.1_22099.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.V6F4VNWIrC/E---3.1_22099.p',idempotence_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.V6F4VNWIrC/E---3.1_22099.p',absorption2) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.V6F4VNWIrC/E---3.1_22099.p',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.V6F4VNWIrC/E---3.1_22099.p',idempotence_of_meet) ).
cnf(prove_distributivity,negated_conjecture,
join(a,meet(b,c)) != meet(join(a,b),join(a,c)),
file('/export/starexec/sandbox/tmp/tmp.V6F4VNWIrC/E---3.1_22099.p',prove_distributivity) ).
cnf(c_0_10,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_11,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_12,axiom,
join(meet(join(meet(X1,X2),X3),X2),meet(X3,X1)) = meet(join(meet(join(X1,X2),X3),X2),join(X3,X1)),
distributivity_dual ).
cnf(c_0_13,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
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,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_17,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
meet(join(X1,X2),join(X3,meet(join(X2,X3),X1))) = join(meet(X1,X2),meet(X3,join(meet(X2,X3),X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11]),c_0_13]),c_0_13]),c_0_11]) ).
cnf(c_0_19,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_21,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_22,plain,
meet(X1,join(X2,join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_23,plain,
join(X1,join(X2,meet(join(X1,X2),X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_24,plain,
join(X1,meet(X2,join(X1,meet(join(X1,X3),X2)))) = meet(join(X1,X3),join(X2,X1)),
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_18,c_0_19]),c_0_14]),c_0_10]),c_0_13]),c_0_10]),c_0_11]) ).
cnf(c_0_25,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_11]),c_0_14]) ).
cnf(c_0_26,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
meet(X1,join(X2,join(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_11]) ).
cnf(c_0_28,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_10]),c_0_14]) ).
cnf(c_0_29,plain,
join(X1,meet(join(X2,X3),join(X1,X2))) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14]),c_0_15]) ).
cnf(c_0_30,plain,
join(X1,join(X2,meet(X3,meet(X4,X1)))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_13]) ).
cnf(c_0_32,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_33,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_34,plain,
join(X1,meet(X2,meet(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_35,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_13]),c_0_21]) ).
cnf(c_0_36,plain,
meet(X1,join(X2,join(X3,join(X1,X4)))) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_37,plain,
join(X1,join(X2,join(X3,X1))) = join(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_28,c_0_14]) ).
cnf(c_0_38,plain,
join(X1,meet(join(X2,X3),join(X1,X3))) = join(X1,X3),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
meet(join(X1,meet(join(X1,X2),X3)),join(X2,meet(join(X1,X2),X3))) = join(meet(X1,X3),meet(X2,join(meet(X1,X2),meet(join(X1,X2),X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_31]),c_0_21]),c_0_32]),c_0_33]),c_0_11]) ).
cnf(c_0_40,plain,
join(X1,join(X2,meet(X1,X3))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_33]),c_0_14]) ).
cnf(c_0_41,plain,
meet(X1,meet(X2,join(X3,join(X4,X1)))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_35,c_0_22]) ).
cnf(c_0_42,plain,
meet(join(X1,X2),join(X2,join(X1,X3))) = join(X2,X1),
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_18,c_0_10]),c_0_14]),c_0_14]),c_0_14]),c_0_28]),c_0_14]),c_0_14]),c_0_13]),c_0_10]),c_0_36]),c_0_37]),c_0_13]) ).
cnf(c_0_43,plain,
join(X1,meet(join(X2,X1),X3)) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_44,plain,
meet(X1,join(X2,X3)) = meet(join(X3,X2),X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
join(X1,meet(X2,join(X1,meet(join(X3,X1),X2)))) = meet(join(X1,X3),join(X2,X1)),
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_18,c_0_28]),c_0_14]),c_0_17]),c_0_13]),c_0_27]),c_0_11]) ).
cnf(c_0_46,plain,
join(X1,meet(X2,join(X1,X3))) = join(X1,meet(X3,X2)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_48,plain,
meet(join(X1,X2),join(X3,X1)) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_21]),c_0_47]),c_0_43]) ).
cnf(c_0_49,negated_conjecture,
join(a,meet(b,c)) != meet(join(a,b),join(a,c)),
prove_distributivity ).
cnf(c_0_50,plain,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X3,X2)),
inference(spm,[status(thm)],[c_0_44,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : LAT009-1 : TPTP v8.1.2. Released v2.2.0.
% 0.04/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n022.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 10:34:24 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.V6F4VNWIrC/E---3.1_22099.p
% 5.04/1.06 # Version: 3.1pre001
% 5.04/1.06 # Preprocessing class: FSSSSMSSSSSNFFN.
% 5.04/1.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.04/1.06 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.04/1.06 # Starting new_bool_3 with 300s (1) cores
% 5.04/1.06 # Starting new_bool_1 with 300s (1) cores
% 5.04/1.06 # Starting sh5l with 300s (1) cores
% 5.04/1.06 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 22227 completed with status 0
% 5.04/1.06 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 5.04/1.06 # Preprocessing class: FSSSSMSSSSSNFFN.
% 5.04/1.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.04/1.06 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.04/1.06 # No SInE strategy applied
% 5.04/1.06 # Search class: FUUPM-FFSF22-MFFFFFNN
% 5.04/1.06 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 5.04/1.06 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 5.04/1.06 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.04/1.06 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.04/1.06 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.04/1.06 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 5.04/1.06 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 22240 completed with status 0
% 5.04/1.06 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 5.04/1.06 # Preprocessing class: FSSSSMSSSSSNFFN.
% 5.04/1.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.04/1.06 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.04/1.06 # No SInE strategy applied
% 5.04/1.06 # Search class: FUUPM-FFSF22-MFFFFFNN
% 5.04/1.06 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 5.04/1.06 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 5.04/1.06 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.04/1.06 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.04/1.06 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.04/1.06 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 5.04/1.06 # Preprocessing time : 0.001 s
% 5.04/1.06
% 5.04/1.06 # Proof found!
% 5.04/1.06 # SZS status Unsatisfiable
% 5.04/1.06 # SZS output start CNFRefutation
% See solution above
% 5.04/1.06 # Parsed axioms : 10
% 5.04/1.06 # Removed by relevancy pruning/SinE : 0
% 5.04/1.06 # Initial clauses : 10
% 5.04/1.06 # Removed in clause preprocessing : 0
% 5.04/1.06 # Initial clauses in saturation : 10
% 5.04/1.06 # Processed clauses : 1932
% 5.04/1.06 # ...of these trivial : 534
% 5.04/1.06 # ...subsumed : 1222
% 5.04/1.06 # ...remaining for further processing : 176
% 5.04/1.06 # Other redundant clauses eliminated : 0
% 5.04/1.06 # Clauses deleted for lack of memory : 0
% 5.04/1.06 # Backward-subsumed : 0
% 5.04/1.06 # Backward-rewritten : 60
% 5.04/1.06 # Generated clauses : 39891
% 5.04/1.06 # ...of the previous two non-redundant : 30519
% 5.04/1.06 # ...aggressively subsumed : 0
% 5.04/1.06 # Contextual simplify-reflections : 0
% 5.04/1.06 # Paramodulations : 39891
% 5.04/1.06 # Factorizations : 0
% 5.04/1.06 # NegExts : 0
% 5.04/1.06 # Equation resolutions : 0
% 5.04/1.06 # Total rewrite steps : 89219
% 5.04/1.06 # Propositional unsat checks : 0
% 5.04/1.06 # Propositional check models : 0
% 5.04/1.06 # Propositional check unsatisfiable : 0
% 5.04/1.06 # Propositional clauses : 0
% 5.04/1.06 # Propositional clauses after purity: 0
% 5.04/1.06 # Propositional unsat core size : 0
% 5.04/1.06 # Propositional preprocessing time : 0.000
% 5.04/1.06 # Propositional encoding time : 0.000
% 5.04/1.06 # Propositional solver time : 0.000
% 5.04/1.06 # Success case prop preproc time : 0.000
% 5.04/1.06 # Success case prop encoding time : 0.000
% 5.04/1.06 # Success case prop solver time : 0.000
% 5.34/1.06 # Current number of processed clauses : 116
% 5.34/1.06 # Positive orientable unit clauses : 107
% 5.34/1.06 # Positive unorientable unit clauses: 9
% 5.34/1.06 # Negative unit clauses : 0
% 5.34/1.06 # Non-unit-clauses : 0
% 5.34/1.06 # Current number of unprocessed clauses: 28548
% 5.34/1.06 # ...number of literals in the above : 28548
% 5.34/1.06 # Current number of archived formulas : 0
% 5.34/1.06 # Current number of archived clauses : 60
% 5.34/1.06 # Clause-clause subsumption calls (NU) : 0
% 5.34/1.06 # Rec. Clause-clause subsumption calls : 0
% 5.34/1.06 # Non-unit clause-clause subsumptions : 0
% 5.34/1.06 # Unit Clause-clause subsumption calls : 65
% 5.34/1.06 # Rewrite failures with RHS unbound : 0
% 5.34/1.06 # BW rewrite match attempts : 1474
% 5.34/1.06 # BW rewrite match successes : 287
% 5.34/1.06 # Condensation attempts : 0
% 5.34/1.06 # Condensation successes : 0
% 5.34/1.06 # Termbank termtop insertions : 738956
% 5.34/1.06
% 5.34/1.06 # -------------------------------------------------
% 5.34/1.06 # User time : 0.601 s
% 5.34/1.06 # System time : 0.026 s
% 5.34/1.06 # Total time : 0.626 s
% 5.34/1.06 # Maximum resident set size: 1516 pages
% 5.34/1.06
% 5.34/1.06 # -------------------------------------------------
% 5.34/1.06 # User time : 3.006 s
% 5.34/1.06 # System time : 0.141 s
% 5.34/1.06 # Total time : 3.147 s
% 5.34/1.06 # Maximum resident set size: 1672 pages
% 5.34/1.06 % E---3.1 exiting
%------------------------------------------------------------------------------