TSTP Solution File: LAT243-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT243-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:08 EDT 2023
% Result : Unsatisfiable 2.66s 0.85s
% Output : CNFRefutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 44 ( 42 unt; 0 nHn; 13 RR)
% Number of literals : 48 ( 47 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 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 : 62 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.vNrkubYla8/E---3.1_9419.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.vNrkubYla8/E---3.1_9419.p',commutativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.vNrkubYla8/E---3.1_9419.p',absorption2) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/tmp/tmp.vNrkubYla8/E---3.1_9419.p',complement_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox/tmp/tmp.vNrkubYla8/E---3.1_9419.p',prove_distributivity_hypothesis) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.vNrkubYla8/E---3.1_9419.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.vNrkubYla8/E---3.1_9419.p',associativity_of_meet) ).
cnf(equation_H57,axiom,
meet(X1,join(X2,meet(X1,join(X2,X3)))) = meet(X1,join(X2,meet(join(X1,X2),join(X3,meet(X1,X2))))),
file('/export/starexec/sandbox/tmp/tmp.vNrkubYla8/E---3.1_9419.p',equation_H57) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/tmp/tmp.vNrkubYla8/E---3.1_9419.p',complement_join) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.vNrkubYla8/E---3.1_9419.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.vNrkubYla8/E---3.1_9419.p',idempotence_of_join) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox/tmp/tmp.vNrkubYla8/E---3.1_9419.p',meet_join_complement) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox/tmp/tmp.vNrkubYla8/E---3.1_9419.p',prove_distributivity) ).
cnf(c_0_13,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_14,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_15,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_16,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_17,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_18,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_19,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_22,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_26,axiom,
meet(X1,join(X2,meet(X1,join(X2,X3)))) = meet(X1,join(X2,meet(join(X1,X2),join(X3,meet(X1,X2))))),
equation_H57 ).
cnf(c_0_27,hypothesis,
meet(a,complement(b)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_25]) ).
cnf(c_0_28,hypothesis,
meet(a,join(complement(b),meet(join(a,complement(b)),X1))) = meet(a,join(complement(b),meet(a,join(complement(b),X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_20]) ).
cnf(c_0_29,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_21]) ).
cnf(c_0_30,hypothesis,
meet(a,join(complement(b),meet(a,join(complement(b),complement(join(a,complement(b))))))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_16]),c_0_20]),c_0_27]) ).
cnf(c_0_31,plain,
meet(X1,meet(X2,join(X3,meet(X1,X2)))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_32,hypothesis,
meet(a,meet(X1,join(complement(b),meet(a,join(complement(b),complement(join(a,complement(b)))))))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_25]) ).
cnf(c_0_33,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_34,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_35,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_36,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_37,hypothesis,
meet(a,join(complement(b),complement(join(a,complement(b))))) = zero,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
join(X1,join(X2,complement(join(X1,X2)))) = one,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_40,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,hypothesis,
join(complement(b),complement(join(a,complement(b)))) = complement(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_42,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_39,c_0_14]) ).
cnf(c_0_43,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_14]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT243-1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 10:06:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.vNrkubYla8/E---3.1_9419.p
% 2.66/0.85 # Version: 3.1pre001
% 2.66/0.85 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.66/0.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.66/0.85 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.66/0.85 # Starting new_bool_3 with 300s (1) cores
% 2.66/0.85 # Starting new_bool_1 with 300s (1) cores
% 2.66/0.85 # Starting sh5l with 300s (1) cores
% 2.66/0.85 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 9504 completed with status 0
% 2.66/0.85 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.66/0.85 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.66/0.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.66/0.85 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.66/0.85 # No SInE strategy applied
% 2.66/0.85 # Search class: FHUPM-FFSF21-MFFFFFNN
% 2.66/0.85 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.66/0.85 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 2.66/0.85 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.66/0.85 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 2.66/0.85 # Starting new_bool_3 with 136s (1) cores
% 2.66/0.85 # Starting new_bool_1 with 136s (1) cores
% 2.66/0.85 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 9511 completed with status 0
% 2.66/0.85 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.66/0.85 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.66/0.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.66/0.85 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.66/0.85 # No SInE strategy applied
% 2.66/0.85 # Search class: FHUPM-FFSF21-MFFFFFNN
% 2.66/0.85 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.66/0.85 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 2.66/0.85 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.66/0.85 # Preprocessing time : 0.002 s
% 2.66/0.85
% 2.66/0.85 # Proof found!
% 2.66/0.85 # SZS status Unsatisfiable
% 2.66/0.85 # SZS output start CNFRefutation
% See solution above
% 2.66/0.85 # Parsed axioms : 14
% 2.66/0.85 # Removed by relevancy pruning/SinE : 0
% 2.66/0.85 # Initial clauses : 14
% 2.66/0.85 # Removed in clause preprocessing : 0
% 2.66/0.85 # Initial clauses in saturation : 14
% 2.66/0.85 # Processed clauses : 1771
% 2.66/0.85 # ...of these trivial : 428
% 2.66/0.85 # ...subsumed : 1064
% 2.66/0.85 # ...remaining for further processing : 279
% 2.66/0.85 # Other redundant clauses eliminated : 0
% 2.66/0.85 # Clauses deleted for lack of memory : 0
% 2.66/0.85 # Backward-subsumed : 44
% 2.66/0.85 # Backward-rewritten : 22
% 2.66/0.85 # Generated clauses : 27626
% 2.66/0.85 # ...of the previous two non-redundant : 17490
% 2.66/0.85 # ...aggressively subsumed : 0
% 2.66/0.85 # Contextual simplify-reflections : 3
% 2.66/0.85 # Paramodulations : 27626
% 2.66/0.85 # Factorizations : 0
% 2.66/0.85 # NegExts : 0
% 2.66/0.85 # Equation resolutions : 0
% 2.66/0.85 # Total rewrite steps : 55819
% 2.66/0.85 # Propositional unsat checks : 0
% 2.66/0.85 # Propositional check models : 0
% 2.66/0.85 # Propositional check unsatisfiable : 0
% 2.66/0.85 # Propositional clauses : 0
% 2.66/0.85 # Propositional clauses after purity: 0
% 2.66/0.85 # Propositional unsat core size : 0
% 2.66/0.85 # Propositional preprocessing time : 0.000
% 2.66/0.85 # Propositional encoding time : 0.000
% 2.66/0.85 # Propositional solver time : 0.000
% 2.66/0.85 # Success case prop preproc time : 0.000
% 2.66/0.85 # Success case prop encoding time : 0.000
% 2.66/0.85 # Success case prop solver time : 0.000
% 2.66/0.85 # Current number of processed clauses : 213
% 2.66/0.85 # Positive orientable unit clauses : 153
% 2.66/0.85 # Positive unorientable unit clauses: 7
% 2.66/0.85 # Negative unit clauses : 17
% 2.66/0.85 # Non-unit-clauses : 36
% 2.66/0.85 # Current number of unprocessed clauses: 15416
% 2.66/0.85 # ...number of literals in the above : 21681
% 2.66/0.85 # Current number of archived formulas : 0
% 2.66/0.85 # Current number of archived clauses : 66
% 2.66/0.85 # Clause-clause subsumption calls (NU) : 980
% 2.66/0.85 # Rec. Clause-clause subsumption calls : 877
% 2.66/0.85 # Non-unit clause-clause subsumptions : 249
% 2.66/0.85 # Unit Clause-clause subsumption calls : 199
% 2.66/0.85 # Rewrite failures with RHS unbound : 0
% 2.66/0.85 # BW rewrite match attempts : 898
% 2.66/0.85 # BW rewrite match successes : 168
% 2.66/0.85 # Condensation attempts : 0
% 2.66/0.85 # Condensation successes : 0
% 2.66/0.85 # Termbank termtop insertions : 425306
% 2.66/0.85
% 2.66/0.85 # -------------------------------------------------
% 2.66/0.85 # User time : 0.326 s
% 2.66/0.85 # System time : 0.017 s
% 2.66/0.85 # Total time : 0.343 s
% 2.66/0.85 # Maximum resident set size: 1588 pages
% 2.66/0.85
% 2.66/0.85 # -------------------------------------------------
% 2.66/0.85 # User time : 1.592 s
% 2.66/0.85 # System time : 0.043 s
% 2.66/0.85 # Total time : 1.635 s
% 2.66/0.85 # Maximum resident set size: 1672 pages
% 2.66/0.85 % E---3.1 exiting
% 2.66/0.85 % E---3.1 exiting
%------------------------------------------------------------------------------