TSTP Solution File: LAT220-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT220-1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:23:58 EDT 2024
% Result : Unsatisfiable 29.74s 4.32s
% Output : CNFRefutation 29.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 61 ( 56 unt; 0 nHn; 18 RR)
% Number of literals : 71 ( 70 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 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 : 92 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity_hypothesis) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_meet) ).
cnf(equation_H3,axiom,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,meet(X3,join(X2,meet(X1,join(X3,meet(X1,X2))))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equation_H3) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',meet_join_complement) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity) ).
cnf(c_0_13,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_14,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_15,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_17,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_18,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_19,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_20,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_21,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_25,axiom,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,meet(X3,join(X2,meet(X1,join(X3,meet(X1,X2))))))),
equation_H3 ).
cnf(c_0_26,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_27,plain,
join(X1,join(complement(X1),X2)) = join(one,X2),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_28,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_20]),c_0_13]) ).
cnf(c_0_30,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20]) ).
cnf(c_0_31,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_32,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_33,plain,
meet(X1,join(X2,meet(X3,join(X2,meet(X1,join(meet(X1,X2),X3)))))) = meet(X1,join(X2,meet(X1,X3))),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_34,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_16]) ).
cnf(c_0_35,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,hypothesis,
join(a,join(X1,b)) = join(X1,b),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_38,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
c_0_31 ).
cnf(c_0_39,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_40,plain,
meet(X1,join(complement(X1),meet(X2,join(complement(X1),meet(X1,X2))))) = meet(X1,join(complement(X1),meet(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_32]) ).
cnf(c_0_41,plain,
meet(X1,join(X2,meet(join(X2,X1),complement(meet(X1,X2))))) = meet(X1,join(X2,meet(X1,complement(meet(X1,X2))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_16]),c_0_34]),c_0_18]) ).
cnf(c_0_42,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20]) ).
cnf(c_0_43,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_34]) ).
cnf(c_0_44,plain,
join(X1,complement(meet(X1,X2))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_16]),c_0_21]) ).
cnf(c_0_45,plain,
( complement(X1) = X2
| meet(X2,X1) != zero
| join(X1,X2) != one ),
inference(spm,[status(thm)],[c_0_38,c_0_18]) ).
cnf(c_0_46,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_18]),c_0_39]) ).
cnf(c_0_47,plain,
join(complement(X1),join(meet(X2,join(complement(X1),meet(X1,X2))),meet(X1,join(complement(X1),meet(X1,X2))))) = join(complement(X1),meet(X2,join(complement(X1),meet(X1,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_40]),c_0_13]) ).
cnf(c_0_48,hypothesis,
meet(complement(a),join(b,meet(complement(a),complement(meet(b,complement(a)))))) = complement(a),
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_41,c_0_42]),c_0_18]),c_0_43]),c_0_44]),c_0_34]),c_0_18]) ).
cnf(c_0_49,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_24]),c_0_20]),c_0_16])]) ).
cnf(c_0_50,hypothesis,
join(b,join(X1,complement(a))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_42]),c_0_21]) ).
cnf(c_0_51,hypothesis,
join(a,join(b,X1)) = join(b,X1),
inference(spm,[status(thm)],[c_0_13,c_0_30]) ).
cnf(c_0_52,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_24,c_0_39]) ).
cnf(c_0_53,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_54,plain,
( complement(X1) = meet(X2,X3)
| meet(X2,meet(X1,X3)) != zero
| join(X1,meet(X2,X3)) != one ),
inference(spm,[status(thm)],[c_0_38,c_0_46]) ).
cnf(c_0_55,hypothesis,
join(b,meet(complement(a),complement(meet(b,complement(a))))) = one,
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_49]),c_0_16]),c_0_34]),c_0_49]),c_0_16]),c_0_34]),c_0_13]),c_0_50]),c_0_21]),c_0_49]),c_0_49]),c_0_16]),c_0_34]),c_0_51]) ).
cnf(c_0_56,plain,
meet(X1,meet(X2,complement(meet(X2,X1)))) = zero,
inference(spm,[status(thm)],[c_0_52,c_0_18]) ).
cnf(c_0_57,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_53 ).
cnf(c_0_58,hypothesis,
meet(complement(a),complement(meet(b,complement(a)))) = complement(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_59,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_57,c_0_20]) ).
cnf(c_0_60,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LAT220-1 : TPTP v8.2.0. Released v3.1.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n002.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Sun May 19 21:12:23 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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/benchmark/theBenchmark.p
% 29.74/4.32 # Version: 3.1.0
% 29.74/4.32 # Preprocessing class: FSSSSMSSSSSNFFN.
% 29.74/4.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.74/4.32 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 29.74/4.32 # Starting new_bool_3 with 300s (1) cores
% 29.74/4.32 # Starting new_bool_1 with 300s (1) cores
% 29.74/4.32 # Starting sh5l with 300s (1) cores
% 29.74/4.32 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 24202 completed with status 0
% 29.74/4.32 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 29.74/4.32 # Preprocessing class: FSSSSMSSSSSNFFN.
% 29.74/4.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.74/4.32 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 29.74/4.32 # No SInE strategy applied
% 29.74/4.32 # Search class: FHUPM-FFSF21-DFFFFFNN
% 29.74/4.32 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 29.74/4.32 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 29.74/4.32 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 29.74/4.32 # Starting new_bool_3 with 136s (1) cores
% 29.74/4.32 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 29.74/4.32 # Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 29.74/4.32 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 24211 completed with status 0
% 29.74/4.32 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 29.74/4.32 # Preprocessing class: FSSSSMSSSSSNFFN.
% 29.74/4.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.74/4.32 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 29.74/4.32 # No SInE strategy applied
% 29.74/4.32 # Search class: FHUPM-FFSF21-DFFFFFNN
% 29.74/4.32 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 29.74/4.32 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 29.74/4.32 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 29.74/4.32 # Starting new_bool_3 with 136s (1) cores
% 29.74/4.32 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 29.74/4.32 # Preprocessing time : 0.001 s
% 29.74/4.32
% 29.74/4.32 # Proof found!
% 29.74/4.32 # SZS status Unsatisfiable
% 29.74/4.32 # SZS output start CNFRefutation
% See solution above
% 29.74/4.32 # Parsed axioms : 14
% 29.74/4.32 # Removed by relevancy pruning/SinE : 0
% 29.74/4.32 # Initial clauses : 14
% 29.74/4.32 # Removed in clause preprocessing : 0
% 29.74/4.32 # Initial clauses in saturation : 14
% 29.74/4.32 # Processed clauses : 6099
% 29.74/4.32 # ...of these trivial : 841
% 29.74/4.32 # ...subsumed : 4627
% 29.74/4.32 # ...remaining for further processing : 631
% 29.74/4.32 # Other redundant clauses eliminated : 0
% 29.74/4.32 # Clauses deleted for lack of memory : 0
% 29.74/4.32 # Backward-subsumed : 67
% 29.74/4.32 # Backward-rewritten : 32
% 29.74/4.32 # Generated clauses : 182442
% 29.74/4.32 # ...of the previous two non-redundant : 132770
% 29.74/4.32 # ...aggressively subsumed : 0
% 29.74/4.32 # Contextual simplify-reflections : 3
% 29.74/4.32 # Paramodulations : 182439
% 29.74/4.32 # Factorizations : 0
% 29.74/4.32 # NegExts : 0
% 29.74/4.32 # Equation resolutions : 3
% 29.74/4.32 # Disequality decompositions : 0
% 29.74/4.32 # Total rewrite steps : 412184
% 29.74/4.32 # ...of those cached : 326518
% 29.74/4.32 # Propositional unsat checks : 0
% 29.74/4.32 # Propositional check models : 0
% 29.74/4.32 # Propositional check unsatisfiable : 0
% 29.74/4.32 # Propositional clauses : 0
% 29.74/4.32 # Propositional clauses after purity: 0
% 29.74/4.32 # Propositional unsat core size : 0
% 29.74/4.32 # Propositional preprocessing time : 0.000
% 29.74/4.32 # Propositional encoding time : 0.000
% 29.74/4.32 # Propositional solver time : 0.000
% 29.74/4.32 # Success case prop preproc time : 0.000
% 29.74/4.32 # Success case prop encoding time : 0.000
% 29.74/4.32 # Success case prop solver time : 0.000
% 29.74/4.32 # Current number of processed clauses : 532
% 29.74/4.32 # Positive orientable unit clauses : 335
% 29.74/4.32 # Positive unorientable unit clauses: 8
% 29.74/4.32 # Negative unit clauses : 38
% 29.74/4.32 # Non-unit-clauses : 151
% 29.74/4.32 # Current number of unprocessed clauses: 126282
% 29.74/4.32 # ...number of literals in the above : 171899
% 29.74/4.32 # Current number of archived formulas : 0
% 29.74/4.32 # Current number of archived clauses : 99
% 29.74/4.32 # Clause-clause subsumption calls (NU) : 13911
% 29.74/4.32 # Rec. Clause-clause subsumption calls : 9987
% 29.74/4.32 # Non-unit clause-clause subsumptions : 847
% 29.74/4.32 # Unit Clause-clause subsumption calls : 656
% 29.74/4.32 # Rewrite failures with RHS unbound : 0
% 29.74/4.32 # BW rewrite match attempts : 8570
% 29.74/4.32 # BW rewrite match successes : 275
% 29.74/4.32 # Condensation attempts : 0
% 29.74/4.32 # Condensation successes : 0
% 29.74/4.32 # Termbank termtop insertions : 4832106
% 29.74/4.32 # Search garbage collected termcells : 8
% 29.74/4.32
% 29.74/4.32 # -------------------------------------------------
% 29.74/4.32 # User time : 3.511 s
% 29.74/4.32 # System time : 0.160 s
% 29.74/4.32 # Total time : 3.671 s
% 29.74/4.32 # Maximum resident set size: 1604 pages
% 29.74/4.32
% 29.74/4.32 # -------------------------------------------------
% 29.74/4.32 # User time : 17.738 s
% 29.74/4.32 # System time : 0.551 s
% 29.74/4.32 # Total time : 18.289 s
% 29.74/4.32 # Maximum resident set size: 1704 pages
% 29.74/4.32 % E---3.1 exiting
% 29.74/4.32 % E exiting
%------------------------------------------------------------------------------