TSTP Solution File: LAT029-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT029-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:26 EDT 2023
% Result : Timeout 0.34s 300.19s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of clauses : 47 ( 44 unt; 0 nHn; 5 RR)
% Number of literals : 54 ( 53 equ; 11 neg)
% Maximal clause size : 4 ( 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 : 86 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wal_absorbtion_4,axiom,
meet(meet(join(X1,X2),join(X3,X1)),X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.y3sMsVgO0d/E---3.1_19675.p',wal_absorbtion_4) ).
cnf(wal_absorbtion_5,axiom,
join(join(meet(X1,X2),meet(X3,X1)),X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.y3sMsVgO0d/E---3.1_19675.p',wal_absorbtion_5) ).
cnf(wal_absorbtion_1,axiom,
join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
file('/export/starexec/sandbox2/tmp/tmp.y3sMsVgO0d/E---3.1_19675.p',wal_absorbtion_1) ).
cnf(wal_absorbtion_2,axiom,
join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
file('/export/starexec/sandbox2/tmp/tmp.y3sMsVgO0d/E---3.1_19675.p',wal_absorbtion_2) ).
cnf(wal_absorbtion_3,axiom,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
file('/export/starexec/sandbox2/tmp/tmp.y3sMsVgO0d/E---3.1_19675.p',wal_absorbtion_3) ).
cnf(prove_normal_axioms,negated_conjecture,
( meet(a,a) != a
| meet(b,a) != meet(a,b)
| join(a,a) != a
| join(b,a) != join(a,b) ),
file('/export/starexec/sandbox2/tmp/tmp.y3sMsVgO0d/E---3.1_19675.p',prove_normal_axioms) ).
cnf(c_0_6,axiom,
meet(meet(join(X1,X2),join(X3,X1)),X1) = X1,
wal_absorbtion_4 ).
cnf(c_0_7,axiom,
join(join(meet(X1,X2),meet(X3,X1)),X1) = X1,
wal_absorbtion_5 ).
cnf(c_0_8,plain,
meet(meet(join(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
wal_absorbtion_1 ).
cnf(c_0_10,plain,
meet(meet(X1,meet(X1,X2)),meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
wal_absorbtion_2 ).
cnf(c_0_12,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_6]),c_0_6]) ).
cnf(c_0_13,plain,
join(meet(X1,X1),join(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
cnf(c_0_14,plain,
join(join(meet(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_15,plain,
meet(join(X1,X1),X1) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_16,plain,
join(X1,join(X1,X1)) = X1,
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_16]) ).
cnf(c_0_18,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_17]) ).
cnf(c_0_19,axiom,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
wal_absorbtion_3 ).
cnf(c_0_20,plain,
join(meet(X1,meet(X2,X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_18]),c_0_12]) ).
cnf(c_0_21,plain,
meet(meet(X1,meet(X2,X1)),meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_22,plain,
meet(meet(X1,meet(X2,X1)),X1) = meet(X1,meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_20]),c_0_17]) ).
cnf(c_0_23,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_21]),c_0_18]),c_0_18]) ).
cnf(c_0_24,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_25,plain,
meet(join(X1,X2),X1) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_24]) ).
cnf(c_0_26,plain,
meet(meet(X1,join(X2,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_17]) ).
cnf(c_0_27,plain,
meet(X1,join(meet(X1,X2),X1)) = join(meet(X1,X2),X1),
inference(spm,[status(thm)],[c_0_25,c_0_14]) ).
cnf(c_0_28,plain,
meet(join(meet(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
join(meet(X1,X2),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_28]),c_0_14]),c_0_28]),c_0_17]) ).
cnf(c_0_30,plain,
join(meet(X1,X2),X2) = X2,
inference(rw,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_31,plain,
meet(meet(X1,X2),X1) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_29]),c_0_17]) ).
cnf(c_0_32,plain,
meet(meet(X1,join(X2,meet(X3,X1))),meet(X3,X1)) = meet(X3,X1),
inference(spm,[status(thm)],[c_0_6,c_0_30]) ).
cnf(c_0_33,plain,
join(X1,meet(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_34,plain,
join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_23]) ).
cnf(c_0_35,plain,
meet(X1,join(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_26,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( meet(a,a) != a
| meet(b,a) != meet(a,b)
| join(a,a) != a
| join(b,a) != join(a,b) ),
prove_normal_axioms ).
cnf(c_0_37,plain,
meet(meet(X1,X2),meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
join(join(X1,meet(X2,join(X3,X1))),join(X3,X1)) = join(X3,X1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
meet(X1,join(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_40,negated_conjecture,
( meet(b,a) != meet(a,b)
| join(b,a) != join(a,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_12])]),c_0_17])]) ).
cnf(c_0_41,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_37]),c_0_37]) ).
cnf(c_0_42,plain,
join(join(X1,X2),X1) = join(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_43,plain,
join(join(X1,X2),join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
join(b,a) != join(a,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_45,plain,
join(X1,X2) = join(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LAT029-1 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n025.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:50:21 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.y3sMsVgO0d/E---3.1_19675.p
% 0.34/300.19 # Version: 3.1pre001
% 0.34/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.34/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.34/300.19 # Starting new_bool_3 with 300s (1) cores
% 0.34/300.19 # Starting new_bool_1 with 300s (1) cores
% 0.34/300.19 # Starting sh5l with 300s (1) cores
% 0.34/300.19 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19776 completed with status 0
% 0.34/300.19 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.34/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.34/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.34/300.19 # No SInE strategy applied
% 0.34/300.19 # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.34/300.19 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.34/300.19 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 811s (1) cores
% 0.34/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.34/300.19 # Starting new_bool_3 with 136s (1) cores
% 0.34/300.19 # Starting new_bool_1 with 136s (1) cores
% 0.34/300.19 # Starting sh5l with 136s (1) cores
% 0.34/300.19 # H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with pid 19780 completed with status 0
% 0.34/300.19 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y
% 0.34/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.34/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.34/300.19 # No SInE strategy applied
% 0.34/300.19 # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.34/300.19 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.34/300.19 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 811s (1) cores
% 0.34/300.19 # Preprocessing time : 0.001 s
% 0.34/300.19 # Presaturation interreduction done
% 0.34/300.19
% 0.34/300.19 # Proof found!
% 0.34/300.19 # SZS status Unsatisfiable
% 0.34/300.19 # SZS output start CNFRefutation
% See solution above
% 0.34/300.19 # Parsed axioms : 6
% 0.34/300.19 # Removed by relevancy pruning/SinE : 0
% 0.34/300.19 # Initial clauses : 6
% 0.34/300.19 # Removed in clause preprocessing : 0
% 0.34/300.19 # Initial clauses in saturation : 6
% 0.34/300.19 # Processed clauses : 119
% 0.34/300.19 # ...of these trivial : 36
% 0.34/300.19 # ...subsumed : 5
% 0.34/300.19 # ...remaining for further processing : 78
% 0.34/300.19 # Other redundant clauses eliminated : 0
% 0.34/300.19 # Clauses deleted for lack of memory : 0
% 0.34/300.19 # Backward-subsumed : 0
% 0.34/300.19 # Backward-rewritten : 46
% 0.34/300.19 # Generated clauses : 2037
% 0.34/300.19 # ...of the previous two non-redundant : 652
% 0.34/300.19 # ...aggressively subsumed : 0
% 0.34/300.19 # Contextual simplify-reflections : 0
% 0.34/300.19 # Paramodulations : 2037
% 0.34/300.19 # Factorizations : 0
% 0.34/300.19 # NegExts : 0
% 0.34/300.19 # Equation resolutions : 0
% 0.34/300.19 # Total rewrite steps : 2547
% 0.34/300.19 # Propositional unsat checks : 0
% 0.34/300.19 # Propositional check models : 0
% 0.34/300.19 # Propositional check unsatisfiable : 0
% 0.34/300.19 # Propositional clauses : 0
% 0.34/300.19 # Propositional clauses after purity: 0
% 0.34/300.19 # Propositional unsat core size : 0
% 0.34/300.19 # Propositional preprocessing time : 0.000
% 0.34/300.19 # Propositional encoding time : 0.000
% 0.34/300.19 # Propositional solver time : 0.000
% 0.34/300.19 # Success case prop preproc time : 0.000
% 0.34/300.19 # Success case prop encoding time : 0.000
% 0.34/300.19 # Success case prop solver time : 0.000
% 0.34/300.19 # Current number of processed clauses : 26
% 0.34/300.19 # Positive orientable unit clauses : 24
% 0.34/300.19 # Positive unorientable unit clauses: 2
% 0.34/300.19 # Negative unit clauses : 0
% 0.34/300.19 # Non-unit-clauses : 0
% 0.34/300.19 # Current number of unprocessed clauses: 469
% 0.34/300.19 # ...number of literals in the above : 469
% 0.34/300.19 # Current number of archived formulas : 0
% 0.34/300.19 # Current number of archived clauses : 52
% 0.34/300.19 # Clause-clause subsumption calls (NU) : 0
% 0.34/300.19 # Rec. Clause-clause subsumption calls : 0
% 0.34/300.19 # Non-unit clause-clause subsumptions : 0
% 0.34/300.19 # Unit Clause-clause subsumption calls : 31
% 0.34/300.19 # Rewrite failures with RHS unbound : 0
% 0.34/300.19 # BW rewrite match attempts : 270
% 0.34/300.19 # BW rewrite match successes : 154
% 0.34/300.19 # Condensation attempts : 0
% 0.34/300.19 # Condensation successes : 0
% 0.34/300.19 # Termbank termtop insertions : 13133
% 0.34/300.19
% 0.34/300.19 # -------------------------------------------------
% 0.34/300.19 # User time : 0.012 s
% 0.34/300.19 # System time : 0.002 s
% 0.34/300.19 # Total time : 0.014 s
% 0.34/300.19 # Maximum resident set size: 1556 pages
% 0.34/300.19
% 0.34/300.19 # -------------------------------------------------
% 0.34/300.19 # User time : 0.063 s
% 0.34/300.19 # System time : 0.004 s
% 0.34/300.19 # Total time : 0.067 s
% 0.34/300.19 # Maximum resident set size: 1668 pages
% 0.34/300.19 % E---3.1 exiting
% 0.34/300.20 % E---3.1 exiting
%------------------------------------------------------------------------------