TSTP Solution File: LAT168-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT168-1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : Mon May 20 23:23:47 EDT 2024
% Result : Unsatisfiable 75.25s 9.99s
% Output : CNFRefutation 75.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 4 RR)
% Number of literals : 34 ( 33 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 75 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(equation_H18_dual,axiom,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(join(X1,X2),meet(join(X1,X3),join(X2,meet(X1,X3))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equation_H18_dual) ).
cnf(prove_H58,negated_conjecture,
meet(a,join(b,c)) != meet(a,join(b,meet(join(a,b),join(c,meet(a,b))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_H58) ).
cnf(c_0_9,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_10,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_11,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_13,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_14,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_16,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_18,plain,
join(X1,meet(X2,meet(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_19,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_20,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_21,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_22,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_23,plain,
join(X1,join(X2,meet(X1,X3))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,plain,
meet(X1,meet(X2,meet(X1,X3))) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_12]),c_0_12]) ).
cnf(c_0_25,plain,
meet(join(X1,X2),join(X2,meet(X1,X3))) = join(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_10]) ).
cnf(c_0_26,axiom,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(join(X1,X2),meet(join(X1,X3),join(X2,meet(X1,X3))))),
equation_H18_dual ).
cnf(c_0_27,plain,
meet(join(X1,X2),meet(X3,join(X2,meet(X1,X4)))) = meet(X3,join(X2,meet(X1,X4))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
join(X1,meet(join(X1,X2),join(X3,meet(X1,X2)))) = meet(join(X1,X3),join(X1,X2)),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
meet(a,join(b,c)) != meet(a,join(b,meet(join(a,b),join(c,meet(a,b))))),
inference(fof_simplification,[status(thm)],[prove_H58]) ).
cnf(c_0_30,plain,
join(X1,meet(join(X1,X2),join(X3,meet(X2,X1)))) = meet(join(X1,X3),join(X1,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_10]) ).
cnf(c_0_31,negated_conjecture,
meet(a,join(b,c)) != meet(a,join(b,meet(join(a,b),join(c,meet(a,b))))),
c_0_29 ).
cnf(c_0_32,plain,
join(X1,meet(join(X2,X1),join(X3,meet(X2,X1)))) = meet(join(X1,X3),join(X2,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_10]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LAT168-1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 20:15:23 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 75.25/9.99 # Version: 3.1.0
% 75.25/9.99 # Preprocessing class: FSSSSMSSSSSNFFN.
% 75.25/9.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 75.25/9.99 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 75.25/9.99 # Starting new_bool_3 with 300s (1) cores
% 75.25/9.99 # Starting new_bool_1 with 300s (1) cores
% 75.25/9.99 # Starting sh5l with 300s (1) cores
% 75.25/9.99 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 29772 completed with status 0
% 75.25/9.99 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 75.25/9.99 # Preprocessing class: FSSSSMSSSSSNFFN.
% 75.25/9.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 75.25/9.99 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 75.25/9.99 # No SInE strategy applied
% 75.25/9.99 # Search class: FUUPM-FFSF22-MFFFFFNN
% 75.25/9.99 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 75.25/9.99 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 75.25/9.99 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 75.25/9.99 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 75.25/9.99 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 75.25/9.99 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 75.25/9.99 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 29782 completed with status 0
% 75.25/9.99 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 75.25/9.99 # Preprocessing class: FSSSSMSSSSSNFFN.
% 75.25/9.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 75.25/9.99 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 75.25/9.99 # No SInE strategy applied
% 75.25/9.99 # Search class: FUUPM-FFSF22-MFFFFFNN
% 75.25/9.99 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 75.25/9.99 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 75.25/9.99 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 75.25/9.99 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 75.25/9.99 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 75.25/9.99 # Preprocessing time : 0.001 s
% 75.25/9.99 # Presaturation interreduction done
% 75.25/9.99
% 75.25/9.99 # Proof found!
% 75.25/9.99 # SZS status Unsatisfiable
% 75.25/9.99 # SZS output start CNFRefutation
% See solution above
% 75.25/9.99 # Parsed axioms : 10
% 75.25/9.99 # Removed by relevancy pruning/SinE : 0
% 75.25/9.99 # Initial clauses : 10
% 75.25/9.99 # Removed in clause preprocessing : 0
% 75.25/9.99 # Initial clauses in saturation : 10
% 75.25/9.99 # Processed clauses : 55294
% 75.25/9.99 # ...of these trivial : 27192
% 75.25/9.99 # ...subsumed : 27298
% 75.25/9.99 # ...remaining for further processing : 804
% 75.25/9.99 # Other redundant clauses eliminated : 0
% 75.25/9.99 # Clauses deleted for lack of memory : 0
% 75.25/9.99 # Backward-subsumed : 0
% 75.25/9.99 # Backward-rewritten : 4
% 75.25/9.99 # Generated clauses : 898321
% 75.25/9.99 # ...of the previous two non-redundant : 553187
% 75.25/9.99 # ...aggressively subsumed : 0
% 75.25/9.99 # Contextual simplify-reflections : 0
% 75.25/9.99 # Paramodulations : 898321
% 75.25/9.99 # Factorizations : 0
% 75.25/9.99 # NegExts : 0
% 75.25/9.99 # Equation resolutions : 0
% 75.25/9.99 # Disequality decompositions : 0
% 75.25/9.99 # Total rewrite steps : 1413674
% 75.25/9.99 # ...of those cached : 1136020
% 75.25/9.99 # Propositional unsat checks : 0
% 75.25/9.99 # Propositional check models : 0
% 75.25/9.99 # Propositional check unsatisfiable : 0
% 75.25/9.99 # Propositional clauses : 0
% 75.25/9.99 # Propositional clauses after purity: 0
% 75.25/9.99 # Propositional unsat core size : 0
% 75.25/9.99 # Propositional preprocessing time : 0.000
% 75.25/9.99 # Propositional encoding time : 0.000
% 75.25/9.99 # Propositional solver time : 0.000
% 75.25/9.99 # Success case prop preproc time : 0.000
% 75.25/9.99 # Success case prop encoding time : 0.000
% 75.25/9.99 # Success case prop solver time : 0.000
% 75.25/9.99 # Current number of processed clauses : 790
% 75.25/9.99 # Positive orientable unit clauses : 780
% 75.25/9.99 # Positive unorientable unit clauses: 10
% 75.25/9.99 # Negative unit clauses : 0
% 75.25/9.99 # Non-unit-clauses : 0
% 75.25/9.99 # Current number of unprocessed clauses: 497853
% 75.25/9.99 # ...number of literals in the above : 497853
% 75.25/9.99 # Current number of archived formulas : 0
% 75.25/9.99 # Current number of archived clauses : 14
% 75.25/9.99 # Clause-clause subsumption calls (NU) : 0
% 75.25/9.99 # Rec. Clause-clause subsumption calls : 0
% 75.25/9.99 # Non-unit clause-clause subsumptions : 0
% 75.25/9.99 # Unit Clause-clause subsumption calls : 66
% 75.25/9.99 # Rewrite failures with RHS unbound : 0
% 75.25/9.99 # BW rewrite match attempts : 24188
% 75.25/9.99 # BW rewrite match successes : 291
% 75.25/9.99 # Condensation attempts : 0
% 75.25/9.99 # Condensation successes : 0
% 75.25/9.99 # Termbank termtop insertions : 11111711
% 75.25/9.99 # Search garbage collected termcells : 2
% 75.25/9.99
% 75.25/9.99 # -------------------------------------------------
% 75.25/9.99 # User time : 8.984 s
% 75.25/9.99 # System time : 0.319 s
% 75.25/9.99 # Total time : 9.303 s
% 75.25/9.99 # Maximum resident set size: 1560 pages
% 75.25/9.99
% 75.25/9.99 # -------------------------------------------------
% 75.25/9.99 # User time : 45.085 s
% 75.25/9.99 # System time : 1.617 s
% 75.25/9.99 # Total time : 46.702 s
% 75.25/9.99 # Maximum resident set size: 1696 pages
% 75.25/9.99 % E---3.1 exiting
% 75.25/9.99 % E exiting
%------------------------------------------------------------------------------