TSTP Solution File: LAT252-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LAT252-1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:26:20 EDT 2024
% Result : Unsatisfiable 37.21s 5.18s
% Output : CNFRefutation 37.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of clauses : 76 ( 72 unt; 0 nHn; 17 RR)
% Number of literals : 83 ( 82 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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 : 126 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity_hypothesis) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',complement_join) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',complement_meet) ).
cnf(equation_H70,axiom,
meet(X1,join(X2,meet(X3,join(X2,X4)))) = meet(X1,join(X2,meet(X3,join(X4,meet(X2,join(X1,X3)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equation_H70) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',meet_join_complement) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity) ).
cnf(c_0_14,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_15,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_16,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_17,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_18,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_19,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_20,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_22,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_21]) ).
cnf(c_0_25,plain,
join(meet(X1,X2),meet(X1,meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_26,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_27,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_28,plain,
meet(join(X1,X2),join(X2,X1)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_30,plain,
join(X1,join(X2,join(X1,X3))) = join(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24]),c_0_21]),c_0_21]) ).
cnf(c_0_31,plain,
join(meet(X1,X2),meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_16]),c_0_26]),c_0_16]),c_0_26]) ).
cnf(c_0_32,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_33,plain,
join(X1,join(X2,meet(X3,join(X2,X1)))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21]) ).
cnf(c_0_34,plain,
join(meet(X1,X2),meet(X2,join(meet(X1,X2),X3))) = meet(X2,join(meet(X1,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_29]),c_0_19]) ).
cnf(c_0_35,plain,
join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_36,plain,
join(meet(X1,X2),join(X3,meet(X2,X1))) = join(meet(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_24]) ).
cnf(c_0_37,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_38,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_39,plain,
join(X1,meet(X2,join(meet(X3,X2),X1))) = join(X1,meet(X3,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
join(meet(X1,X2),X3) = join(X3,meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_31]),c_0_36]) ).
cnf(c_0_41,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_16,c_0_37]) ).
cnf(c_0_42,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_43,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_38]) ).
cnf(c_0_44,plain,
join(X1,meet(X2,join(X1,meet(X2,X3)))) = join(X1,meet(X3,X2)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,axiom,
meet(X1,join(X2,meet(X3,join(X2,X4)))) = meet(X1,join(X2,meet(X3,join(X4,meet(X2,join(X1,X3)))))),
equation_H70 ).
cnf(c_0_46,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_47,hypothesis,
meet(a,complement(b)) = meet(a,zero),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_22,c_0_42]) ).
cnf(c_0_49,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_43,c_0_15]) ).
cnf(c_0_50,hypothesis,
meet(a,join(b,X1)) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_18]),c_0_37]) ).
cnf(c_0_51,plain,
join(X1,meet(X2,join(X3,meet(X1,X2)))) = join(X1,meet(join(X1,X3),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_44]),c_0_46]),c_0_15]) ).
cnf(c_0_52,hypothesis,
meet(a,complement(b)) = zero,
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_42]) ).
cnf(c_0_54,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_18,c_0_49]) ).
cnf(c_0_55,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_15,c_0_48]) ).
cnf(c_0_56,hypothesis,
join(b,join(X1,a)) = join(b,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_50]),c_0_21]) ).
cnf(c_0_57,hypothesis,
join(a,meet(complement(b),join(a,X1))) = join(a,meet(complement(b),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_15]) ).
cnf(c_0_58,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_38]),c_0_54]) ).
cnf(c_0_59,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_60,plain,
meet(X1,meet(complement(X1),X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_42]),c_0_55]) ).
cnf(c_0_61,hypothesis,
join(b,join(X1,join(a,X2))) = join(b,join(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_56]),c_0_21]),c_0_21]) ).
cnf(c_0_62,hypothesis,
join(a,meet(complement(a),complement(b))) = join(a,complement(b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_38]),c_0_43]),c_0_15]) ).
cnf(c_0_63,plain,
join(X1,join(X2,complement(X1))) = one,
inference(spm,[status(thm)],[c_0_58,c_0_19]) ).
cnf(c_0_64,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_46]) ).
cnf(c_0_65,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
c_0_59 ).
cnf(c_0_66,plain,
meet(X1,meet(X2,complement(X1))) = zero,
inference(spm,[status(thm)],[c_0_60,c_0_26]) ).
cnf(c_0_67,hypothesis,
join(b,join(X1,meet(complement(a),complement(b)))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_61]),c_0_63]) ).
cnf(c_0_68,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_64,c_0_38]) ).
cnf(c_0_69,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_70,plain,
( meet(X1,complement(X2)) = complement(X2)
| join(X2,meet(X1,complement(X2))) != one ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,hypothesis,
join(b,meet(complement(a),complement(b))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_67]),c_0_68]),c_0_64]) ).
cnf(c_0_72,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_69 ).
cnf(c_0_73,hypothesis,
meet(complement(a),complement(b)) = complement(b),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_72,c_0_19]) ).
cnf(c_0_75,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_73]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT252-1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 19:56:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 37.21/5.18 # Version: 3.1.0
% 37.21/5.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 37.21/5.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.21/5.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 37.21/5.18 # Starting new_bool_3 with 300s (1) cores
% 37.21/5.18 # Starting new_bool_1 with 300s (1) cores
% 37.21/5.18 # Starting sh5l with 300s (1) cores
% 37.21/5.18 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 24895 completed with status 0
% 37.21/5.18 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 37.21/5.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 37.21/5.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.21/5.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 37.21/5.18 # No SInE strategy applied
% 37.21/5.18 # Search class: FHUPM-FFSF21-DFFFFFNN
% 37.21/5.18 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 37.21/5.18 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 37.21/5.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 37.21/5.18 # Starting new_bool_3 with 136s (1) cores
% 37.21/5.18 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 37.21/5.18 # Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 37.21/5.18 # E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 24899 completed with status 0
% 37.21/5.18 # Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 37.21/5.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 37.21/5.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.21/5.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 37.21/5.18 # No SInE strategy applied
% 37.21/5.18 # Search class: FHUPM-FFSF21-DFFFFFNN
% 37.21/5.18 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 37.21/5.18 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 37.21/5.18 # Preprocessing time : 0.001 s
% 37.21/5.18 # Presaturation interreduction done
% 37.21/5.18
% 37.21/5.18 # Proof found!
% 37.21/5.18 # SZS status Unsatisfiable
% 37.21/5.18 # SZS output start CNFRefutation
% See solution above
% 37.21/5.18 # Parsed axioms : 14
% 37.21/5.18 # Removed by relevancy pruning/SinE : 0
% 37.21/5.18 # Initial clauses : 14
% 37.21/5.18 # Removed in clause preprocessing : 0
% 37.21/5.18 # Initial clauses in saturation : 14
% 37.21/5.18 # Processed clauses : 16209
% 37.21/5.18 # ...of these trivial : 8998
% 37.21/5.18 # ...subsumed : 5976
% 37.21/5.18 # ...remaining for further processing : 1235
% 37.21/5.18 # Other redundant clauses eliminated : 0
% 37.21/5.18 # Clauses deleted for lack of memory : 0
% 37.21/5.18 # Backward-subsumed : 13
% 37.21/5.18 # Backward-rewritten : 163
% 37.21/5.18 # Generated clauses : 530457
% 37.21/5.18 # ...of the previous two non-redundant : 211164
% 37.21/5.18 # ...aggressively subsumed : 0
% 37.21/5.18 # Contextual simplify-reflections : 0
% 37.21/5.18 # Paramodulations : 530446
% 37.21/5.18 # Factorizations : 0
% 37.21/5.18 # NegExts : 0
% 37.21/5.18 # Equation resolutions : 11
% 37.21/5.18 # Disequality decompositions : 0
% 37.21/5.18 # Total rewrite steps : 1393866
% 37.21/5.18 # ...of those cached : 1218365
% 37.21/5.18 # Propositional unsat checks : 0
% 37.21/5.18 # Propositional check models : 0
% 37.21/5.18 # Propositional check unsatisfiable : 0
% 37.21/5.18 # Propositional clauses : 0
% 37.21/5.18 # Propositional clauses after purity: 0
% 37.21/5.18 # Propositional unsat core size : 0
% 37.21/5.18 # Propositional preprocessing time : 0.000
% 37.21/5.18 # Propositional encoding time : 0.000
% 37.21/5.18 # Propositional solver time : 0.000
% 37.21/5.18 # Success case prop preproc time : 0.000
% 37.21/5.18 # Success case prop encoding time : 0.000
% 37.21/5.18 # Success case prop solver time : 0.000
% 37.21/5.18 # Current number of processed clauses : 1045
% 37.21/5.18 # Positive orientable unit clauses : 922
% 37.21/5.18 # Positive unorientable unit clauses: 10
% 37.21/5.18 # Negative unit clauses : 1
% 37.21/5.18 # Non-unit-clauses : 112
% 37.21/5.18 # Current number of unprocessed clauses: 194612
% 37.21/5.18 # ...number of literals in the above : 209457
% 37.21/5.18 # Current number of archived formulas : 0
% 37.21/5.18 # Current number of archived clauses : 190
% 37.21/5.18 # Clause-clause subsumption calls (NU) : 9152
% 37.21/5.18 # Rec. Clause-clause subsumption calls : 9152
% 37.21/5.18 # Non-unit clause-clause subsumptions : 3164
% 37.21/5.18 # Unit Clause-clause subsumption calls : 755
% 37.21/5.18 # Rewrite failures with RHS unbound : 0
% 37.21/5.18 # BW rewrite match attempts : 15325
% 37.21/5.18 # BW rewrite match successes : 2382
% 37.21/5.18 # Condensation attempts : 0
% 37.21/5.18 # Condensation successes : 0
% 37.21/5.18 # Termbank termtop insertions : 8182690
% 37.21/5.18 # Search garbage collected termcells : 8
% 37.21/5.18
% 37.21/5.18 # -------------------------------------------------
% 37.21/5.18 # User time : 4.379 s
% 37.21/5.18 # System time : 0.169 s
% 37.21/5.18 # Total time : 4.548 s
% 37.21/5.18 # Maximum resident set size: 1660 pages
% 37.21/5.18
% 37.21/5.18 # -------------------------------------------------
% 37.21/5.18 # User time : 22.263 s
% 37.21/5.18 # System time : 0.705 s
% 37.21/5.18 # Total time : 22.968 s
% 37.21/5.18 # Maximum resident set size: 1704 pages
% 37.21/5.18 % E---3.1 exiting
%------------------------------------------------------------------------------