TSTP Solution File: LAT012-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT012-1 : TPTP v8.1.2. Released v2.2.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:13:40 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 4 RR)
% Number of literals : 21 ( 20 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mckenzie2,axiom,
meet(X1,join(X2,join(X1,X3))) = X1,
file('/export/starexec/sandbox/tmp/tmp.KMo2uLgNuI/E---3.1_21566.p',mckenzie2) ).
cnf(mckenzie1,axiom,
join(X1,meet(X2,meet(X1,X3))) = X1,
file('/export/starexec/sandbox/tmp/tmp.KMo2uLgNuI/E---3.1_21566.p',mckenzie1) ).
cnf(mckenzie3,axiom,
join(join(meet(X1,X2),meet(X2,X3)),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.KMo2uLgNuI/E---3.1_21566.p',mckenzie3) ).
cnf(mckenzie4,axiom,
meet(meet(join(X1,X2),join(X2,X3)),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.KMo2uLgNuI/E---3.1_21566.p',mckenzie4) ).
cnf(prove_commutativity_of_meet,negated_conjecture,
meet(b,a) != meet(a,b),
file('/export/starexec/sandbox/tmp/tmp.KMo2uLgNuI/E---3.1_21566.p',prove_commutativity_of_meet) ).
cnf(c_0_5,axiom,
meet(X1,join(X2,join(X1,X3))) = X1,
mckenzie2 ).
cnf(c_0_6,axiom,
join(X1,meet(X2,meet(X1,X3))) = X1,
mckenzie1 ).
cnf(c_0_7,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
join(join(meet(X1,X2),meet(X2,X3)),X2) = X2,
mckenzie3 ).
cnf(c_0_9,plain,
meet(meet(X1,meet(X2,X3)),X2) = meet(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_10,axiom,
meet(meet(join(X1,X2),join(X2,X3)),X2) = X2,
mckenzie4 ).
cnf(c_0_11,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_12,plain,
join(meet(X1,X2),X2) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_13,plain,
meet(meet(X1,X2),X1) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
meet(meet(X1,join(meet(X2,X1),X3)),meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
join(meet(X1,X2),X1) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
meet(b,a) != meet(a,b),
inference(fof_simplification,[status(thm)],[prove_commutativity_of_meet]) ).
cnf(c_0_17,plain,
meet(meet(X1,X2),meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
meet(b,a) != meet(a,b),
c_0_16 ).
cnf(c_0_19,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LAT012-1 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 08:16:41 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/tmp/tmp.KMo2uLgNuI/E---3.1_21566.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 21654 completed with status 0
% 0.21/0.51 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.21/0.51 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.21/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.51 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.51 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.51 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.21/0.51 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 21661 completed with status 0
% 0.21/0.51 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.21/0.51 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.21/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 5
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 5
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 5
% 0.21/0.51 # Processed clauses : 58
% 0.21/0.51 # ...of these trivial : 28
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 30
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 8
% 0.21/0.51 # Generated clauses : 633
% 0.21/0.51 # ...of the previous two non-redundant : 257
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 633
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 498
% 0.21/0.51 # ...of those cached : 365
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 22
% 0.21/0.51 # Positive orientable unit clauses : 21
% 0.21/0.51 # Positive unorientable unit clauses: 1
% 0.21/0.51 # Negative unit clauses : 0
% 0.21/0.51 # Non-unit-clauses : 0
% 0.21/0.51 # Current number of unprocessed clauses: 201
% 0.21/0.51 # ...number of literals in the above : 201
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 8
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 9
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 103
% 0.21/0.52 # BW rewrite match successes : 52
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 3418
% 0.21/0.52 # Search garbage collected termcells : 2
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.009 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.012 s
% 0.21/0.52 # Maximum resident set size: 1548 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.035 s
% 0.21/0.52 # System time : 0.012 s
% 0.21/0.52 # Total time : 0.047 s
% 0.21/0.52 # Maximum resident set size: 1688 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------