TSTP Solution File: LAT234-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT234-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:06 EDT 2023
% Result : Unsatisfiable 0.16s 0.63s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 46 ( 44 unt; 0 nHn; 14 RR)
% Number of literals : 50 ( 49 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 : 63 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',prove_distributivity_hypothesis) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',idempotence_of_join) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',absorption1) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',complement_join) ).
cnf(equation_H32,axiom,
meet(X1,join(X2,meet(X1,meet(X3,X4)))) = meet(X1,join(X2,meet(X3,join(meet(X1,X4),meet(X2,X4))))),
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',equation_H32) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',complement_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',associativity_of_meet) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',prove_distributivity) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',commutativity_of_join) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p',meet_join_complement) ).
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,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_19,hypothesis,
join(b,a) = b,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_21,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_22,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_23,hypothesis,
join(b,join(a,X1)) = join(b,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_25,axiom,
meet(X1,join(X2,meet(X1,meet(X3,X4)))) = meet(X1,join(X2,meet(X3,join(meet(X1,X4),meet(X2,X4))))),
equation_H32 ).
cnf(c_0_26,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,hypothesis,
join(b,complement(a)) = join(b,one),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_28,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_29,plain,
meet(X1,join(X2,meet(X3,join(X1,X2)))) = meet(X1,join(X2,meet(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_26]),c_0_26]) ).
cnf(c_0_30,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_32,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_33,hypothesis,
meet(b,join(complement(a),meet(b,X1))) = meet(b,join(complement(a),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26]) ).
cnf(c_0_34,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_31]) ).
cnf(c_0_35,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_14]) ).
cnf(c_0_36,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_32,c_0_17]) ).
cnf(c_0_37,hypothesis,
meet(b,join(complement(a),complement(b))) = meet(b,complement(a)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_34]) ).
cnf(c_0_38,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_21,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_40,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_41,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_42,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_37]),c_0_36]),c_0_31]) ).
cnf(c_0_43,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_38]) ).
cnf(c_0_44,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : LAT234-1 : TPTP v8.1.2. Released v3.1.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n006.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 09:54:25 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.mCKnZGeh4t/E---3.1_12821.p
% 0.16/0.63 # Version: 3.1pre001
% 0.16/0.63 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.63 # Starting sh5l with 300s (1) cores
% 0.16/0.63 # sh5l with pid 12951 completed with status 0
% 0.16/0.63 # Result found by sh5l
% 0.16/0.63 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.63 # Starting sh5l with 300s (1) cores
% 0.16/0.63 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.63 # Search class: FHUPM-FFSF21-MFFFFFNN
% 0.16/0.63 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.63 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 163s (1) cores
% 0.16/0.63 # G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 12958 completed with status 0
% 0.16/0.63 # Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 0.16/0.63 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.63 # Starting sh5l with 300s (1) cores
% 0.16/0.63 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.63 # Search class: FHUPM-FFSF21-MFFFFFNN
% 0.16/0.63 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.63 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 163s (1) cores
% 0.16/0.63 # Preprocessing time : 0.001 s
% 0.16/0.63 # Presaturation interreduction done
% 0.16/0.63
% 0.16/0.63 # Proof found!
% 0.16/0.63 # SZS status Unsatisfiable
% 0.16/0.63 # SZS output start CNFRefutation
% See solution above
% 0.16/0.63 # Parsed axioms : 14
% 0.16/0.63 # Removed by relevancy pruning/SinE : 0
% 0.16/0.63 # Initial clauses : 14
% 0.16/0.63 # Removed in clause preprocessing : 0
% 0.16/0.63 # Initial clauses in saturation : 14
% 0.16/0.63 # Processed clauses : 1103
% 0.16/0.63 # ...of these trivial : 668
% 0.16/0.63 # ...subsumed : 145
% 0.16/0.63 # ...remaining for further processing : 290
% 0.16/0.63 # Other redundant clauses eliminated : 0
% 0.16/0.63 # Clauses deleted for lack of memory : 0
% 0.16/0.63 # Backward-subsumed : 0
% 0.16/0.63 # Backward-rewritten : 33
% 0.16/0.63 # Generated clauses : 21055
% 0.16/0.63 # ...of the previous two non-redundant : 7821
% 0.16/0.63 # ...aggressively subsumed : 0
% 0.16/0.63 # Contextual simplify-reflections : 0
% 0.16/0.63 # Paramodulations : 21052
% 0.16/0.63 # Factorizations : 0
% 0.16/0.63 # NegExts : 0
% 0.16/0.63 # Equation resolutions : 3
% 0.16/0.63 # Total rewrite steps : 43910
% 0.16/0.63 # Propositional unsat checks : 0
% 0.16/0.63 # Propositional check models : 0
% 0.16/0.63 # Propositional check unsatisfiable : 0
% 0.16/0.63 # Propositional clauses : 0
% 0.16/0.63 # Propositional clauses after purity: 0
% 0.16/0.63 # Propositional unsat core size : 0
% 0.16/0.63 # Propositional preprocessing time : 0.000
% 0.16/0.63 # Propositional encoding time : 0.000
% 0.16/0.63 # Propositional solver time : 0.000
% 0.16/0.63 # Success case prop preproc time : 0.000
% 0.16/0.63 # Success case prop encoding time : 0.000
% 0.16/0.63 # Success case prop solver time : 0.000
% 0.16/0.63 # Current number of processed clauses : 243
% 0.16/0.63 # Positive orientable unit clauses : 229
% 0.16/0.63 # Positive unorientable unit clauses: 4
% 0.16/0.63 # Negative unit clauses : 1
% 0.16/0.63 # Non-unit-clauses : 9
% 0.16/0.63 # Current number of unprocessed clauses: 6702
% 0.16/0.63 # ...number of literals in the above : 6875
% 0.16/0.63 # Current number of archived formulas : 0
% 0.16/0.63 # Current number of archived clauses : 47
% 0.16/0.63 # Clause-clause subsumption calls (NU) : 73
% 0.16/0.63 # Rec. Clause-clause subsumption calls : 73
% 0.16/0.63 # Non-unit clause-clause subsumptions : 43
% 0.16/0.63 # Unit Clause-clause subsumption calls : 25
% 0.16/0.63 # Rewrite failures with RHS unbound : 0
% 0.16/0.63 # BW rewrite match attempts : 801
% 0.16/0.63 # BW rewrite match successes : 239
% 0.16/0.63 # Condensation attempts : 0
% 0.16/0.63 # Condensation successes : 0
% 0.16/0.63 # Termbank termtop insertions : 286933
% 0.16/0.63
% 0.16/0.63 # -------------------------------------------------
% 0.16/0.63 # User time : 0.181 s
% 0.16/0.63 # System time : 0.012 s
% 0.16/0.63 # Total time : 0.193 s
% 0.16/0.63 # Maximum resident set size: 1664 pages
% 0.16/0.63
% 0.16/0.63 # -------------------------------------------------
% 0.16/0.63 # User time : 0.182 s
% 0.16/0.63 # System time : 0.013 s
% 0.16/0.63 # Total time : 0.196 s
% 0.16/0.63 # Maximum resident set size: 1672 pages
% 0.16/0.63 % E---3.1 exiting
% 0.16/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------