TSTP Solution File: LAT257-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT257-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:10:13 EDT 2023
% Result : Unsatisfiable 0.16s 0.50s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 46 ( 44 unt; 0 nHn; 13 RR)
% Number of literals : 50 ( 49 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 64 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',idempotence_of_join) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',complement_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',prove_distributivity_hypothesis) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',complement_meet) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',commutativity_of_join) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',absorption1) ).
cnf(equation_H82,axiom,
meet(X1,join(meet(X2,join(X1,X3)),meet(X3,join(X1,X2)))) = join(meet(X1,X2),meet(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',equation_H82) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',associativity_of_meet) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',prove_distributivity) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p',meet_join_complement) ).
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,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_21,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_22,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_25,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_26,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
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_21,c_0_22]) ).
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_21]),c_0_13]) ).
cnf(c_0_30,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]) ).
cnf(c_0_31,axiom,
meet(X1,join(meet(X2,join(X1,X3)),meet(X3,join(X1,X2)))) = join(meet(X1,X2),meet(X1,X3)),
equation_H82 ).
cnf(c_0_32,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_33,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_26]) ).
cnf(c_0_34,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,hypothesis,
join(a,join(X1,b)) = join(X1,b),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_37,plain,
meet(X1,join(X2,meet(complement(X1),join(X1,X2)))) = 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_31,c_0_16]),c_0_20]),c_0_32]),c_0_21]),c_0_33]) ).
cnf(c_0_38,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_21]) ).
cnf(c_0_39,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_36,c_0_24]) ).
cnf(c_0_40,hypothesis,
meet(b,join(complement(a),complement(b))) = meet(b,complement(a)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_32]) ).
cnf(c_0_41,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_42,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_43,hypothesis,
meet(a,join(complement(a),complement(b))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_39]),c_0_20]) ).
cnf(c_0_44,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_41,c_0_21]) ).
cnf(c_0_45,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_34])]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LAT257-1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n005.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 10:27:46 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.KSsntUUi0y/E---3.1_5605.p
% 0.16/0.50 # Version: 3.1pre001
% 0.16/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 # Starting sh5l with 300s (1) cores
% 0.16/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 5682 completed with status 0
% 0.16/0.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.50 # No SInE strategy applied
% 0.16/0.50 # Search class: FHUPM-FFSF21-MFFFFFNN
% 0.16/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 0.16/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.50 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.16/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 5689 completed with status 0
% 0.16/0.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.50 # No SInE strategy applied
% 0.16/0.50 # Search class: FHUPM-FFSF21-MFFFFFNN
% 0.16/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 0.16/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.50 # Preprocessing time : 0.001 s
% 0.16/0.50
% 0.16/0.50 # Proof found!
% 0.16/0.50 # SZS status Unsatisfiable
% 0.16/0.50 # SZS output start CNFRefutation
% See solution above
% 0.16/0.50 # Parsed axioms : 14
% 0.16/0.50 # Removed by relevancy pruning/SinE : 0
% 0.16/0.50 # Initial clauses : 14
% 0.16/0.50 # Removed in clause preprocessing : 0
% 0.16/0.50 # Initial clauses in saturation : 14
% 0.16/0.50 # Processed clauses : 332
% 0.16/0.50 # ...of these trivial : 85
% 0.16/0.50 # ...subsumed : 102
% 0.16/0.50 # ...remaining for further processing : 145
% 0.16/0.50 # Other redundant clauses eliminated : 0
% 0.16/0.50 # Clauses deleted for lack of memory : 0
% 0.16/0.50 # Backward-subsumed : 23
% 0.16/0.50 # Backward-rewritten : 22
% 0.16/0.50 # Generated clauses : 4841
% 0.16/0.50 # ...of the previous two non-redundant : 3627
% 0.16/0.50 # ...aggressively subsumed : 0
% 0.16/0.50 # Contextual simplify-reflections : 2
% 0.16/0.50 # Paramodulations : 4840
% 0.16/0.50 # Factorizations : 0
% 0.16/0.50 # NegExts : 0
% 0.16/0.50 # Equation resolutions : 1
% 0.16/0.50 # Total rewrite steps : 7384
% 0.16/0.50 # Propositional unsat checks : 0
% 0.16/0.50 # Propositional check models : 0
% 0.16/0.50 # Propositional check unsatisfiable : 0
% 0.16/0.50 # Propositional clauses : 0
% 0.16/0.50 # Propositional clauses after purity: 0
% 0.16/0.50 # Propositional unsat core size : 0
% 0.16/0.50 # Propositional preprocessing time : 0.000
% 0.16/0.50 # Propositional encoding time : 0.000
% 0.16/0.50 # Propositional solver time : 0.000
% 0.16/0.50 # Success case prop preproc time : 0.000
% 0.16/0.50 # Success case prop encoding time : 0.000
% 0.16/0.50 # Success case prop solver time : 0.000
% 0.16/0.50 # Current number of processed clauses : 100
% 0.16/0.50 # Positive orientable unit clauses : 69
% 0.16/0.50 # Positive unorientable unit clauses: 6
% 0.16/0.50 # Negative unit clauses : 5
% 0.16/0.50 # Non-unit-clauses : 20
% 0.16/0.50 # Current number of unprocessed clauses: 3267
% 0.16/0.50 # ...number of literals in the above : 4884
% 0.16/0.50 # Current number of archived formulas : 0
% 0.16/0.50 # Current number of archived clauses : 45
% 0.16/0.50 # Clause-clause subsumption calls (NU) : 337
% 0.16/0.50 # Rec. Clause-clause subsumption calls : 254
% 0.16/0.50 # Non-unit clause-clause subsumptions : 41
% 0.16/0.50 # Unit Clause-clause subsumption calls : 53
% 0.16/0.50 # Rewrite failures with RHS unbound : 0
% 0.16/0.50 # BW rewrite match attempts : 162
% 0.16/0.50 # BW rewrite match successes : 78
% 0.16/0.50 # Condensation attempts : 0
% 0.16/0.50 # Condensation successes : 0
% 0.16/0.50 # Termbank termtop insertions : 67217
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.069 s
% 0.16/0.50 # System time : 0.005 s
% 0.16/0.50 # Total time : 0.074 s
% 0.16/0.50 # Maximum resident set size: 1592 pages
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.354 s
% 0.16/0.50 # System time : 0.017 s
% 0.16/0.50 # Total time : 0.371 s
% 0.16/0.50 # Maximum resident set size: 1676 pages
% 0.16/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------