TSTP Solution File: LAT097-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT097-1 : TPTP v8.1.2. Released v2.6.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:09:53 EDT 2023
% Result : Unsatisfiable 0.64s 0.55s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 3 RR)
% Number of literals : 30 ( 29 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 83 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)),meet(X6,join(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)))),join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
file('/export/starexec/sandbox2/tmp/tmp.5BAcjUFjIo/E---3.1_5544.p',single_axiom) ).
cnf(prove_wal_axioms_6,negated_conjecture,
join(join(meet(a,b),meet(c,b)),b) != b,
file('/export/starexec/sandbox2/tmp/tmp.5BAcjUFjIo/E---3.1_5544.p',prove_wal_axioms_6) ).
cnf(c_0_2,axiom,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)),meet(X6,join(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)))),join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
join(meet(join(meet(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))),meet(join(meet(X2,X3),meet(X3,join(X2,X3))),join(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))))),X4),meet(join(meet(X1,join(join(meet(join(meet(X2,X3),meet(X3,join(X2,X3))),X5),meet(X6,join(meet(X2,X3),meet(X3,join(X2,X3))))),join(meet(X2,X3),meet(X3,join(X2,X3))))),meet(X3,join(X1,join(join(meet(join(meet(X2,X3),meet(X3,join(X2,X3))),X5),meet(X6,join(meet(X2,X3),meet(X3,join(X2,X3))))),join(meet(X2,X3),meet(X3,join(X2,X3))))))),join(join(meet(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))),meet(join(meet(X2,X3),meet(X3,join(X2,X3))),join(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))))),X4))) = join(meet(X2,X3),meet(X3,join(X2,X3))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(join(meet(X6,join(join(meet(X2,X7),meet(X8,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X7),join(X8,X2)),X2)),meet(X9,join(X2,meet(meet(join(X2,X7),join(X8,X2)),X2)))),join(X6,join(join(meet(X2,X7),meet(X8,X2)),X2)))),join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
join(meet(join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X2),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X2))),X3),meet(X2,join(join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X2),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_6,plain,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(X2,join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_8,plain,
join(meet(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)),meet(X2,join(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_6]),c_0_6]),c_0_7]) ).
cnf(c_0_9,plain,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,plain,
join(meet(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X3),join(X4,X2)),X2)),meet(X5,join(X2,meet(meet(join(X2,X3),join(X4,X2)),X2)))),join(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_2]),c_0_2]),c_0_7]) ).
cnf(c_0_11,plain,
join(meet(X1,meet(meet(join(X1,X2),join(X3,X1)),X1)),meet(X4,join(X1,meet(meet(join(X1,X2),join(X3,X1)),X1)))) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_11]) ).
cnf(c_0_13,plain,
meet(meet(join(X1,X2),join(X3,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_15,plain,
join(join(meet(X1,X2),meet(X3,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_16,plain,
meet(meet(join(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_17,plain,
meet(meet(X1,meet(X1,X2)),meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_2]),c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_18,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_13]) ).
cnf(c_0_19,plain,
join(meet(X1,X1),join(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_20,plain,
join(join(meet(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_21,plain,
meet(join(X1,X1),X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_22,plain,
join(X1,join(X1,X1)) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_23,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_22]) ).
cnf(c_0_24,plain,
meet(meet(X1,meet(X2,X1)),meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_25,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_23]),c_0_16]),c_0_18]),c_0_16]),c_0_23]) ).
cnf(c_0_26,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_24]),c_0_25]),c_0_25]) ).
cnf(c_0_27,negated_conjecture,
join(join(meet(a,b),meet(c,b)),b) != b,
prove_wal_axioms_6 ).
cnf(c_0_28,plain,
join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT097-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 09:58:09 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.5BAcjUFjIo/E---3.1_5544.p
% 0.64/0.55 # Version: 3.1pre001
% 0.64/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.64/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.64/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.64/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.64/0.55 # Starting sh5l with 300s (1) cores
% 0.64/0.55 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 5621 completed with status 0
% 0.64/0.55 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.64/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.64/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.64/0.55 # No SInE strategy applied
% 0.64/0.55 # Search class: FUUPF-FFSF22-DFFFFFNN
% 0.64/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.64/0.55 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.64/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.64/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.64/0.55 # Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.64/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.64/0.55 # G----_0015_C18_F1_SE_CS_SP_S0Y with pid 5630 completed with status 0
% 0.64/0.55 # Result found by G----_0015_C18_F1_SE_CS_SP_S0Y
% 0.64/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.64/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.64/0.55 # No SInE strategy applied
% 0.64/0.55 # Search class: FUUPF-FFSF22-DFFFFFNN
% 0.64/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.64/0.55 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.64/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.64/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.64/0.55 # Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.64/0.55 # Preprocessing time : 0.001 s
% 0.64/0.55
% 0.64/0.55 # Proof found!
% 0.64/0.55 # SZS status Unsatisfiable
% 0.64/0.55 # SZS output start CNFRefutation
% See solution above
% 0.64/0.55 # Parsed axioms : 2
% 0.64/0.55 # Removed by relevancy pruning/SinE : 0
% 0.64/0.55 # Initial clauses : 2
% 0.64/0.55 # Removed in clause preprocessing : 0
% 0.64/0.55 # Initial clauses in saturation : 2
% 0.64/0.55 # Processed clauses : 134
% 0.64/0.55 # ...of these trivial : 78
% 0.64/0.55 # ...subsumed : 0
% 0.64/0.55 # ...remaining for further processing : 56
% 0.64/0.55 # Other redundant clauses eliminated : 0
% 0.64/0.55 # Clauses deleted for lack of memory : 0
% 0.64/0.55 # Backward-subsumed : 0
% 0.64/0.55 # Backward-rewritten : 29
% 0.64/0.55 # Generated clauses : 2295
% 0.64/0.55 # ...of the previous two non-redundant : 1387
% 0.64/0.55 # ...aggressively subsumed : 0
% 0.64/0.55 # Contextual simplify-reflections : 0
% 0.64/0.55 # Paramodulations : 2295
% 0.64/0.55 # Factorizations : 0
% 0.64/0.55 # NegExts : 0
% 0.64/0.55 # Equation resolutions : 0
% 0.64/0.55 # Total rewrite steps : 9811
% 0.64/0.55 # Propositional unsat checks : 0
% 0.64/0.55 # Propositional check models : 0
% 0.64/0.55 # Propositional check unsatisfiable : 0
% 0.64/0.55 # Propositional clauses : 0
% 0.64/0.55 # Propositional clauses after purity: 0
% 0.64/0.55 # Propositional unsat core size : 0
% 0.64/0.55 # Propositional preprocessing time : 0.000
% 0.64/0.55 # Propositional encoding time : 0.000
% 0.64/0.55 # Propositional solver time : 0.000
% 0.64/0.55 # Success case prop preproc time : 0.000
% 0.64/0.55 # Success case prop encoding time : 0.000
% 0.64/0.55 # Success case prop solver time : 0.000
% 0.64/0.55 # Current number of processed clauses : 27
% 0.64/0.55 # Positive orientable unit clauses : 27
% 0.64/0.55 # Positive unorientable unit clauses: 0
% 0.64/0.55 # Negative unit clauses : 0
% 0.64/0.55 # Non-unit-clauses : 0
% 0.64/0.55 # Current number of unprocessed clauses: 1242
% 0.64/0.55 # ...number of literals in the above : 1242
% 0.64/0.55 # Current number of archived formulas : 0
% 0.64/0.55 # Current number of archived clauses : 29
% 0.64/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.64/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.64/0.55 # Non-unit clause-clause subsumptions : 0
% 0.64/0.55 # Unit Clause-clause subsumption calls : 0
% 0.64/0.55 # Rewrite failures with RHS unbound : 0
% 0.64/0.55 # BW rewrite match attempts : 269
% 0.64/0.55 # BW rewrite match successes : 20
% 0.64/0.55 # Condensation attempts : 0
% 0.64/0.55 # Condensation successes : 0
% 0.64/0.55 # Termbank termtop insertions : 192237
% 0.64/0.55
% 0.64/0.55 # -------------------------------------------------
% 0.64/0.55 # User time : 0.053 s
% 0.64/0.55 # System time : 0.003 s
% 0.64/0.55 # Total time : 0.056 s
% 0.64/0.55 # Maximum resident set size: 1508 pages
% 0.64/0.55
% 0.64/0.55 # -------------------------------------------------
% 0.64/0.55 # User time : 0.270 s
% 0.64/0.55 # System time : 0.012 s
% 0.64/0.55 # Total time : 0.282 s
% 0.64/0.55 # Maximum resident set size: 1680 pages
% 0.64/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------