TSTP Solution File: LAT219-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LAT219-1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:12 EDT 2024
% Result : Unsatisfiable 6.83s 1.37s
% Output : CNFRefutation 6.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 49 ( 46 unt; 0 nHn; 16 RR)
% Number of literals : 55 ( 54 equ; 10 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 : 70 ( 10 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(equation_H2,axiom,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,meet(X3,join(meet(X1,join(X2,X3)),meet(X2,X3))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equation_H2) ).
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(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_meet) ).
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,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,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_26,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_27,axiom,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,meet(X3,join(meet(X1,join(X2,X3)),meet(X2,X3))))),
equation_H2 ).
cnf(c_0_28,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_24]) ).
cnf(c_0_29,hypothesis,
join(a,join(X1,b)) = join(X1,b),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_31,plain,
meet(X1,join(X2,meet(X3,join(meet(X2,X3),meet(X1,join(X2,X3)))))) = meet(X1,join(X2,meet(X1,X3))),
inference(rw,[status(thm)],[c_0_27,c_0_20]) ).
cnf(c_0_32,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20]) ).
cnf(c_0_33,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_34,hypothesis,
meet(X1,join(b,meet(complement(a),join(meet(b,complement(a)),X1)))) = meet(X1,join(b,meet(X1,complement(a)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_35,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_36,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_37,hypothesis,
meet(complement(meet(b,complement(a))),join(b,meet(complement(a),complement(meet(b,complement(a)))))) = complement(meet(b,complement(a))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_16]),c_0_33]),c_0_32]),c_0_33]),c_0_18]) ).
cnf(c_0_38,plain,
join(X1,complement(meet(X1,X2))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_16]),c_0_21]) ).
cnf(c_0_39,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_40,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_41,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_42,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
c_0_36 ).
cnf(c_0_43,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(spm,[status(thm)],[c_0_22,c_0_37]),c_0_13]),c_0_20]),c_0_22]),c_0_38]) ).
cnf(c_0_44,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_41 ).
cnf(c_0_46,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_42,c_0_43]),c_0_44])]) ).
cnf(c_0_47,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_45,c_0_20]) ).
cnf(c_0_48,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LAT219-1 : TPTP v8.2.0. Released v3.1.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n024.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Sun May 19 20:59:52 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.18/0.47 Running first-order model finding
% 0.18/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 6.83/1.37 # Version: 3.1.0
% 6.83/1.37 # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.83/1.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.83/1.37 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.83/1.37 # Starting new_bool_3 with 300s (1) cores
% 6.83/1.37 # Starting new_bool_1 with 300s (1) cores
% 6.83/1.37 # Starting sh5l with 300s (1) cores
% 6.83/1.37 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 10894 completed with status 0
% 6.83/1.37 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 6.83/1.37 # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.83/1.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.83/1.37 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.83/1.37 # No SInE strategy applied
% 6.83/1.37 # Search class: FHUPM-FFSF21-DFFFFFNN
% 6.83/1.37 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.83/1.37 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 6.83/1.37 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.83/1.37 # Starting new_bool_3 with 136s (1) cores
% 6.83/1.37 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 6.83/1.37 # Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 6.83/1.37 # G-E--_303_C18_F1_URBAN_S0Y with pid 10905 completed with status 0
% 6.83/1.37 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 6.83/1.37 # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.83/1.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.83/1.37 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.83/1.37 # No SInE strategy applied
% 6.83/1.37 # Search class: FHUPM-FFSF21-DFFFFFNN
% 6.83/1.37 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.83/1.37 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 6.83/1.37 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.83/1.37 # Starting new_bool_3 with 136s (1) cores
% 6.83/1.37 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 6.83/1.37 # Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 6.83/1.37 # Preprocessing time : 0.001 s
% 6.83/1.37
% 6.83/1.37 # Proof found!
% 6.83/1.37 # SZS status Unsatisfiable
% 6.83/1.37 # SZS output start CNFRefutation
% See solution above
% 6.83/1.37 # Parsed axioms : 14
% 6.83/1.37 # Removed by relevancy pruning/SinE : 0
% 6.83/1.37 # Initial clauses : 14
% 6.83/1.37 # Removed in clause preprocessing : 0
% 6.83/1.37 # Initial clauses in saturation : 14
% 6.83/1.37 # Processed clauses : 2683
% 6.83/1.37 # ...of these trivial : 525
% 6.83/1.37 # ...subsumed : 1768
% 6.83/1.37 # ...remaining for further processing : 390
% 6.83/1.37 # Other redundant clauses eliminated : 0
% 6.83/1.37 # Clauses deleted for lack of memory : 0
% 6.83/1.37 # Backward-subsumed : 24
% 6.83/1.37 # Backward-rewritten : 36
% 6.83/1.37 # Generated clauses : 62185
% 6.83/1.37 # ...of the previous two non-redundant : 40660
% 6.83/1.37 # ...aggressively subsumed : 0
% 6.83/1.37 # Contextual simplify-reflections : 0
% 6.83/1.37 # Paramodulations : 62183
% 6.83/1.37 # Factorizations : 0
% 6.83/1.37 # NegExts : 0
% 6.83/1.37 # Equation resolutions : 2
% 6.83/1.37 # Disequality decompositions : 0
% 6.83/1.37 # Total rewrite steps : 103953
% 6.83/1.37 # ...of those cached : 78547
% 6.83/1.37 # Propositional unsat checks : 0
% 6.83/1.37 # Propositional check models : 0
% 6.83/1.37 # Propositional check unsatisfiable : 0
% 6.83/1.37 # Propositional clauses : 0
% 6.83/1.37 # Propositional clauses after purity: 0
% 6.83/1.37 # Propositional unsat core size : 0
% 6.83/1.37 # Propositional preprocessing time : 0.000
% 6.83/1.37 # Propositional encoding time : 0.000
% 6.83/1.37 # Propositional solver time : 0.000
% 6.83/1.37 # Success case prop preproc time : 0.000
% 6.83/1.37 # Success case prop encoding time : 0.000
% 6.83/1.37 # Success case prop solver time : 0.000
% 6.83/1.37 # Current number of processed clauses : 330
% 6.83/1.37 # Positive orientable unit clauses : 215
% 6.83/1.37 # Positive unorientable unit clauses: 8
% 6.83/1.37 # Negative unit clauses : 33
% 6.83/1.37 # Non-unit-clauses : 74
% 6.83/1.37 # Current number of unprocessed clauses: 37804
% 6.83/1.37 # ...number of literals in the above : 55886
% 6.83/1.37 # Current number of archived formulas : 0
% 6.83/1.37 # Current number of archived clauses : 60
% 6.83/1.37 # Clause-clause subsumption calls (NU) : 1489
% 6.83/1.37 # Rec. Clause-clause subsumption calls : 1471
% 6.83/1.37 # Non-unit clause-clause subsumptions : 157
% 6.83/1.37 # Unit Clause-clause subsumption calls : 269
% 6.83/1.37 # Rewrite failures with RHS unbound : 0
% 6.83/1.37 # BW rewrite match attempts : 2137
% 6.83/1.37 # BW rewrite match successes : 273
% 6.83/1.37 # Condensation attempts : 0
% 6.83/1.37 # Condensation successes : 0
% 6.83/1.37 # Termbank termtop insertions : 905059
% 6.83/1.37 # Search garbage collected termcells : 8
% 6.83/1.37
% 6.83/1.37 # -------------------------------------------------
% 6.83/1.37 # User time : 0.809 s
% 6.83/1.37 # System time : 0.033 s
% 6.83/1.37 # Total time : 0.842 s
% 6.83/1.37 # Maximum resident set size: 1656 pages
% 6.83/1.37
% 6.83/1.37 # -------------------------------------------------
% 6.83/1.37 # User time : 4.210 s
% 6.83/1.37 # System time : 0.125 s
% 6.83/1.37 # Total time : 4.335 s
% 6.83/1.37 # Maximum resident set size: 1704 pages
% 6.83/1.37 % E---3.1 exiting
%------------------------------------------------------------------------------