TSTP Solution File: LAT038-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT038-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:07:27 EDT 2023
% Result : Unsatisfiable 1.40s 0.61s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 15 RR)
% Number of literals : 36 ( 35 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 47 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.na1BLt8p0B/E---3.1_19447.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.na1BLt8p0B/E---3.1_19447.p',commutativity_of_meet) ).
cnf(lhs2,hypothesis,
meet(f(aa,dd),f(bb,dd)) = meet(f(cc,dd),f(bb,dd)),
file('/export/starexec/sandbox2/tmp/tmp.na1BLt8p0B/E---3.1_19447.p',lhs2) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.na1BLt8p0B/E---3.1_19447.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.na1BLt8p0B/E---3.1_19447.p',commutativity_of_join) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.na1BLt8p0B/E---3.1_19447.p',associativity_of_meet) ).
cnf(dist_meet,hypothesis,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.na1BLt8p0B/E---3.1_19447.p',dist_meet) ).
cnf(lhs1,hypothesis,
f(join(aa,bb),dd) = f(join(cc,bb),dd),
file('/export/starexec/sandbox2/tmp/tmp.na1BLt8p0B/E---3.1_19447.p',lhs1) ).
cnf(f_on_left_join,axiom,
f(join(X1,X2),X3) = join(f(X1,X3),f(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.na1BLt8p0B/E---3.1_19447.p',f_on_left_join) ).
cnf(rhs,negated_conjecture,
f(aa,dd) != f(cc,dd),
file('/export/starexec/sandbox2/tmp/tmp.na1BLt8p0B/E---3.1_19447.p',rhs) ).
cnf(c_0_10,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_11,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_12,hypothesis,
meet(f(aa,dd),f(bb,dd)) = meet(f(cc,dd),f(bb,dd)),
lhs2 ).
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,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,hypothesis,
meet(f(bb,dd),f(aa,dd)) = meet(f(bb,dd),f(cc,dd)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11]),c_0_11]) ).
cnf(c_0_17,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
join(f(aa,dd),meet(f(bb,dd),f(cc,dd))) = f(aa,dd),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_20,hypothesis,
meet(f(bb,dd),meet(f(cc,dd),f(aa,dd))) = meet(f(bb,dd),f(cc,dd)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_21,hypothesis,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
dist_meet ).
cnf(c_0_22,hypothesis,
f(join(aa,bb),dd) = f(join(cc,bb),dd),
lhs1 ).
cnf(c_0_23,hypothesis,
join(meet(f(bb,dd),f(cc,dd)),meet(f(cc,dd),f(aa,dd))) = meet(f(cc,dd),f(aa,dd)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_14]) ).
cnf(c_0_24,hypothesis,
join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(X1,X3)),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_25,axiom,
f(join(X1,X2),X3) = join(f(X1,X3),f(X2,X3)),
f_on_left_join ).
cnf(c_0_26,hypothesis,
f(join(bb,aa),dd) = f(join(bb,cc),dd),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_14]),c_0_14]) ).
cnf(c_0_27,hypothesis,
meet(f(cc,dd),f(join(bb,cc),dd)) = meet(f(cc,dd),f(aa,dd)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_28,plain,
meet(f(X1,X2),f(join(X3,X1),X2)) = f(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_29,hypothesis,
meet(f(cc,dd),f(aa,dd)) = f(cc,dd),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,hypothesis,
meet(f(aa,dd),join(f(cc,dd),X1)) = join(f(cc,dd),meet(f(aa,dd),X1)),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_31,hypothesis,
join(f(cc,dd),meet(f(aa,dd),f(X1,dd))) = meet(f(aa,dd),f(join(cc,X1),dd)),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
cnf(c_0_32,hypothesis,
join(f(cc,dd),meet(f(X1,dd),f(aa,dd))) = meet(f(aa,dd),f(join(cc,X1),dd)),
inference(spm,[status(thm)],[c_0_31,c_0_11]) ).
cnf(c_0_33,hypothesis,
meet(f(aa,dd),f(join(bb,cc),dd)) = f(aa,dd),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
f(aa,dd) != f(cc,dd),
rhs ).
cnf(c_0_35,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_16]),c_0_15]),c_0_14]),c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LAT038-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.32 % Computer : n007.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 2400
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon Oct 2 10:15:09 EDT 2023
% 0.13/0.32 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.na1BLt8p0B/E---3.1_19447.p
% 1.40/0.61 # Version: 3.1pre001
% 1.40/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.40/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.40/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.40/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.40/0.61 # Starting sh5l with 300s (1) cores
% 1.40/0.61 # new_bool_1 with pid 19595 completed with status 0
% 1.40/0.61 # Result found by new_bool_1
% 1.40/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.40/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.40/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.40/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.40/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.40/0.61 # Search class: FUUPM-FFSF22-SFFFFFNN
% 1.40/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.40/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.40/0.61 # SAT001_MinMin_p005000_rr_RG with pid 19601 completed with status 0
% 1.40/0.61 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.40/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.40/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.40/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.40/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.40/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.40/0.61 # Search class: FUUPM-FFSF22-SFFFFFNN
% 1.40/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.40/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.40/0.61 # Preprocessing time : 0.001 s
% 1.40/0.61 # Presaturation interreduction done
% 1.40/0.61
% 1.40/0.61 # Proof found!
% 1.40/0.61 # SZS status Unsatisfiable
% 1.40/0.61 # SZS output start CNFRefutation
% See solution above
% 1.40/0.61 # Parsed axioms : 17
% 1.40/0.61 # Removed by relevancy pruning/SinE : 2
% 1.40/0.61 # Initial clauses : 15
% 1.40/0.61 # Removed in clause preprocessing : 0
% 1.40/0.61 # Initial clauses in saturation : 15
% 1.40/0.61 # Processed clauses : 1003
% 1.40/0.61 # ...of these trivial : 514
% 1.40/0.61 # ...subsumed : 235
% 1.40/0.61 # ...remaining for further processing : 254
% 1.40/0.61 # Other redundant clauses eliminated : 0
% 1.40/0.61 # Clauses deleted for lack of memory : 0
% 1.40/0.61 # Backward-subsumed : 0
% 1.40/0.61 # Backward-rewritten : 33
% 1.40/0.61 # Generated clauses : 19098
% 1.40/0.61 # ...of the previous two non-redundant : 11863
% 1.40/0.61 # ...aggressively subsumed : 0
% 1.40/0.61 # Contextual simplify-reflections : 0
% 1.40/0.61 # Paramodulations : 19098
% 1.40/0.61 # Factorizations : 0
% 1.40/0.61 # NegExts : 0
% 1.40/0.61 # Equation resolutions : 0
% 1.40/0.61 # Total rewrite steps : 22150
% 1.40/0.61 # Propositional unsat checks : 0
% 1.40/0.61 # Propositional check models : 0
% 1.40/0.61 # Propositional check unsatisfiable : 0
% 1.40/0.61 # Propositional clauses : 0
% 1.40/0.61 # Propositional clauses after purity: 0
% 1.40/0.61 # Propositional unsat core size : 0
% 1.40/0.61 # Propositional preprocessing time : 0.000
% 1.40/0.61 # Propositional encoding time : 0.000
% 1.40/0.61 # Propositional solver time : 0.000
% 1.40/0.61 # Success case prop preproc time : 0.000
% 1.40/0.61 # Success case prop encoding time : 0.000
% 1.40/0.61 # Success case prop solver time : 0.000
% 1.40/0.61 # Current number of processed clauses : 206
% 1.40/0.61 # Positive orientable unit clauses : 197
% 1.40/0.61 # Positive unorientable unit clauses: 8
% 1.40/0.61 # Negative unit clauses : 1
% 1.40/0.61 # Non-unit-clauses : 0
% 1.40/0.61 # Current number of unprocessed clauses: 10731
% 1.40/0.61 # ...number of literals in the above : 10731
% 1.40/0.61 # Current number of archived formulas : 0
% 1.40/0.61 # Current number of archived clauses : 48
% 1.40/0.61 # Clause-clause subsumption calls (NU) : 0
% 1.40/0.61 # Rec. Clause-clause subsumption calls : 0
% 1.40/0.61 # Non-unit clause-clause subsumptions : 0
% 1.40/0.61 # Unit Clause-clause subsumption calls : 59
% 1.40/0.61 # Rewrite failures with RHS unbound : 0
% 1.40/0.61 # BW rewrite match attempts : 933
% 1.40/0.61 # BW rewrite match successes : 379
% 1.40/0.61 # Condensation attempts : 0
% 1.40/0.61 # Condensation successes : 0
% 1.40/0.61 # Termbank termtop insertions : 274807
% 1.40/0.61
% 1.40/0.61 # -------------------------------------------------
% 1.40/0.61 # User time : 0.140 s
% 1.40/0.61 # System time : 0.013 s
% 1.40/0.61 # Total time : 0.153 s
% 1.40/0.61 # Maximum resident set size: 1608 pages
% 1.40/0.61
% 1.40/0.61 # -------------------------------------------------
% 1.40/0.61 # User time : 0.143 s
% 1.40/0.61 # System time : 0.013 s
% 1.40/0.61 # Total time : 0.156 s
% 1.40/0.61 # Maximum resident set size: 1672 pages
% 1.40/0.61 % E---3.1 exiting
% 1.40/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------