TSTP Solution File: LAT254-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT254-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:08:10 EDT 2023
% Result : Timeout 1.57s 300.10s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 45 ( 43 unt; 0 nHn; 11 RR)
% Number of literals : 49 ( 48 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 66 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',commutativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',absorption2) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',complement_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',prove_distributivity_hypothesis) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',commutativity_of_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',associativity_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',idempotence_of_join) ).
cnf(equation_H79,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(meet(X1,join(X2,meet(X1,X3))),meet(X3,X4))),
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',equation_H79) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',idempotence_of_meet) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',complement_join) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',prove_distributivity) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p',meet_join_complement) ).
cnf(c_0_14,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_15,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_16,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_17,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_18,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_19,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_20,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_23,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_26,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_27,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(meet(X1,join(X2,meet(X1,X3))),meet(X3,X4))),
equation_H79 ).
cnf(c_0_28,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_29,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_31,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_33,plain,
meet(X1,join(X2,meet(X1,join(X3,meet(X1,X2))))) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_15]),c_0_20]) ).
cnf(c_0_34,hypothesis,
meet(a,complement(b)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_17]),c_0_30]) ).
cnf(c_0_35,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,hypothesis,
meet(a,join(complement(b),meet(a,X1))) = meet(a,join(X1,complement(b))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_21]) ).
cnf(c_0_37,plain,
join(X1,join(complement(X1),X2)) = join(one,X2),
inference(spm,[status(thm)],[c_0_25,c_0_32]) ).
cnf(c_0_38,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_15,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_40,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_41,hypothesis,
meet(a,join(complement(a),complement(b))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_17]),c_0_21]),c_0_34]) ).
cnf(c_0_42,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_39,c_0_15]) ).
cnf(c_0_44,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : LAT254-1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n001.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 11:36:36 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.jGYXYZTI77/E---3.1_23900.p
% 1.57/300.10 # Version: 3.1pre001
% 1.57/300.10 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.57/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/300.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.57/300.10 # Starting new_bool_3 with 300s (1) cores
% 1.57/300.10 # Starting new_bool_1 with 300s (1) cores
% 1.57/300.10 # Starting sh5l with 300s (1) cores
% 1.57/300.10 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 24020 completed with status 0
% 1.57/300.10 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.57/300.10 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.57/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/300.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.57/300.10 # No SInE strategy applied
% 1.57/300.10 # Search class: FHUPM-FFSF21-MFFFFFNN
% 1.57/300.10 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.57/300.10 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 1.57/300.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.57/300.10 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 1.57/300.10 # Starting new_bool_3 with 136s (1) cores
% 1.57/300.10 # Starting new_bool_1 with 136s (1) cores
% 1.57/300.10 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 24027 completed with status 0
% 1.57/300.10 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.57/300.10 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.57/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/300.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.57/300.10 # No SInE strategy applied
% 1.57/300.10 # Search class: FHUPM-FFSF21-MFFFFFNN
% 1.57/300.10 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.57/300.10 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 1.57/300.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.57/300.10 # Preprocessing time : 0.001 s
% 1.57/300.10
% 1.57/300.10 # Proof found!
% 1.57/300.10 # SZS status Unsatisfiable
% 1.57/300.10 # SZS output start CNFRefutation
% See solution above
% 1.57/300.10 # Parsed axioms : 14
% 1.57/300.10 # Removed by relevancy pruning/SinE : 0
% 1.57/300.10 # Initial clauses : 14
% 1.57/300.10 # Removed in clause preprocessing : 0
% 1.57/300.10 # Initial clauses in saturation : 14
% 1.57/300.10 # Processed clauses : 907
% 1.57/300.10 # ...of these trivial : 304
% 1.57/300.10 # ...subsumed : 396
% 1.57/300.10 # ...remaining for further processing : 207
% 1.57/300.10 # Other redundant clauses eliminated : 0
% 1.57/300.10 # Clauses deleted for lack of memory : 0
% 1.57/300.10 # Backward-subsumed : 29
% 1.57/300.10 # Backward-rewritten : 27
% 1.57/300.10 # Generated clauses : 12480
% 1.57/300.10 # ...of the previous two non-redundant : 7963
% 1.57/300.10 # ...aggressively subsumed : 0
% 1.57/300.10 # Contextual simplify-reflections : 3
% 1.57/300.10 # Paramodulations : 12479
% 1.57/300.10 # Factorizations : 0
% 1.57/300.10 # NegExts : 0
% 1.57/300.10 # Equation resolutions : 1
% 1.57/300.10 # Total rewrite steps : 19653
% 1.57/300.10 # Propositional unsat checks : 0
% 1.57/300.10 # Propositional check models : 0
% 1.57/300.10 # Propositional check unsatisfiable : 0
% 1.57/300.10 # Propositional clauses : 0
% 1.57/300.10 # Propositional clauses after purity: 0
% 1.57/300.10 # Propositional unsat core size : 0
% 1.57/300.10 # Propositional preprocessing time : 0.000
% 1.57/300.10 # Propositional encoding time : 0.000
% 1.57/300.10 # Propositional solver time : 0.000
% 1.57/300.10 # Success case prop preproc time : 0.000
% 1.57/300.10 # Success case prop encoding time : 0.000
% 1.57/300.10 # Success case prop solver time : 0.000
% 1.57/300.10 # Current number of processed clauses : 151
% 1.57/300.10 # Positive orientable unit clauses : 106
% 1.57/300.10 # Positive unorientable unit clauses: 8
% 1.57/300.10 # Negative unit clauses : 7
% 1.57/300.10 # Non-unit-clauses : 30
% 1.57/300.10 # Current number of unprocessed clauses: 6935
% 1.57/300.10 # ...number of literals in the above : 10194
% 1.57/300.10 # Current number of archived formulas : 0
% 1.57/300.10 # Current number of archived clauses : 56
% 1.57/300.10 # Clause-clause subsumption calls (NU) : 802
% 1.57/300.10 # Rec. Clause-clause subsumption calls : 626
% 1.57/300.10 # Non-unit clause-clause subsumptions : 173
% 1.57/300.10 # Unit Clause-clause subsumption calls : 106
% 1.57/300.10 # Rewrite failures with RHS unbound : 0
% 1.57/300.10 # BW rewrite match attempts : 434
% 1.57/300.10 # BW rewrite match successes : 152
% 1.57/300.10 # Condensation attempts : 0
% 1.57/300.10 # Condensation successes : 0
% 1.57/300.10 # Termbank termtop insertions : 158363
% 1.57/300.10
% 1.57/300.10 # -------------------------------------------------
% 1.57/300.10 # User time : 0.160 s
% 1.57/300.10 # System time : 0.012 s
% 1.57/300.10 # Total time : 0.172 s
% 1.57/300.10 # Maximum resident set size: 1592 pages
% 1.57/300.10
% 1.57/300.10 # -------------------------------------------------
% 1.57/300.10 # User time : 0.839 s
% 1.57/300.10 # System time : 0.031 s
% 1.57/300.10 # Total time : 0.870 s
% 1.57/300.10 # Maximum resident set size: 1676 pages
% 1.57/300.10 % E---3.1 exiting
% 1.57/300.10 % E---3.1 exiting
%------------------------------------------------------------------------------